Data Structures and Algorithms in Java
The third edition of this conceptually elegant and pedagogically innovative text continues to incorporate the object-oriented design paradigm, using Java as the implementation language, while also providing intuition and analysis of fundamental data structures and algorithms. All of this is done in a clear, friendly writing style that uses visuals to introduce and simplify important analytic and mathematical concepts.
* Entirely new chapter on recursion
* Additional exercises on the analysis of simple algorithms
* New case study on parenthesis matching and HTML validation
Results 1-3 of 13
When inserting key k, we splay the newly created internal node where k gets
inserted. For example, the splaying in Figures 9.16 and 9.17 would be performed
if 14 were the newly inserted key. We show a sequence of insertions in a splay
When deleting a node v from a splay tree with n keys, the ranks of all the
ancestors of v are decreased. Thus, the total variation of r(T) caused by the
deletion is negative, and we do not need to make any payment to maintain the
invariant when ...
Draw an example red-black tree that is not an AVL tree. Consider a tree T storing
100,000 entries. What is the worst-case height of T in the following cases? a. T is
an AVL tree. T is a (2,4) tree. T is a red-black tree. T is a splay tree. T is a binary ...
What people are saying - Write a review
LibraryThing ReviewUser Review - daschaich - LibraryThing
Third edition is much improved: When I learned that this was the required book for my introductory data structures class this semester, I was somewhat worried by the large number of very negative ... Read full review
11 other sections not shown