Additional exercises on the analysis of simple algorithms
New case study on parenthesis matching and HTML validation
Expanded coverage of splay trees
Added examples and programming exercises throughout
About The Author Michael Goodrich received his Ph.D. in computer science from Purdue University in 1987. He is currently a professor in the Department of Computer Science at University of California, Irvine. Previously, he was a professor at Johns Hopkins University. He is an editor for the International Journal of Computational Geometry & Applications and Journal of Graph Algorithms and Applications.
Roberto Tamassia received his Ph.D. in Electrical and Computer Engineering from the University of Illinois at Urbana-Champaign in 1988. He is currently a professor in the Department of Computer Science at Brown University. He is editor-in-chief for the Journal of Graph Algorithms and Applications and an editor for Computational Geometry: Theory and Applications. He previously served on the editorial board of IEEE Transactions on Computers.
Awesome book but obviously you need to have basic understanding of java. nobye are hard to get it.overall the book is Awesome.Algo are clearly understood.But you have read data structure in c then you can easily understand the logic of Data structure. After reading the you have a depth knowledge in data structure.