Data Structures And Algorithms In Java

0.0

Entirely new chapter on recursion 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. Table Of Contents Java Programming Object-Oriented Design Analysis Tools Stacks, Queues, And Recursion Vectors, Lists, And Sequences Trees Priority Queues Maps And Dictionaries Search Trees Sorting, Sets And Selection Text Processing Graphs Appendix: Useful Mathematical Facts Bibliography Index