Data Structures and Algorithms in JavaThe 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 |
From inside the book
Results 1-3 of 8
Page 436
... splaying is performed are as follows : • When searching for key k , if k is found at a node x , we splay x , else we splay the parent of the external node at which the search terminates unsuccessfully . For example , the splaying in ...
... splaying is performed are as follows : • When searching for key k , if k is found at a node x , we splay x , else we splay the parent of the external node at which the search terminates unsuccessfully . For example , the splaying in ...
Page 437
... splaying the parent u of v ; ( b ) splaying u starts with a zig - zig ; ( c ) after the zig - zig ; ( d ) the next step is a zig ; ( e ) after the zig . 9.3.3 Amortized Analysis of Splaying After a zig - zig 9.3 . Splay Trees 437.
... splaying the parent u of v ; ( b ) splaying u starts with a zig - zig ; ( c ) after the zig - zig ; ( d ) the next step is a zig ; ( e ) after the zig . 9.3.3 Amortized Analysis of Splaying After a zig - zig 9.3 . Splay Trees 437.
Page 439
... splaying work , then we use it all to pay for the splaying . • If the payment is greater than the splaying work , we deposit the excess in the accounts of several nodes . • If the payment is less than the splaying work , we make ...
... splaying work , then we use it all to pay for the splaying . • If the payment is greater than the splaying work , we deposit the excess in the accounts of several nodes . • If the payment is less than the splaying work , we make ...
Other editions - View all
Data Structures and Algorithms in Java Michael T. Goodrich,Roberto Tamassia No preview available - 2004 |
Common terms and phrases
Abstract Data Type algorithm analysis array array-based AVL tree big-Oh notation binary search tree binary tree bucket array Code Fragment computing constant constructor data structure define denote deque dequeue Describe dictionary double doubly linked list edges empty entry with key Euler tour example execution external node Fibonacci Figure function given graph heap Input insert instance variables integer interface Invalid Position Exception isEmpty iterator Java implementation Java program Justification logn loop memory merge-sort method null number of elements O(logn O(n² Output parameter perform primitive operations priority queue problem Proposition pseudo-code public boolean public class public Object public static public void queue ADT quick-sort recursive call red-black tree reference remove root run-time running Section sequence shown in Code simple singly linked list skip list sorting splay tree splaying statement string subtree tags traversal update vector vertex vertices worst-case