Data Structures and Algorithms in JavaUsing a unique multimedia format for learning the fundamentals of data structures and algorithms, this conceptually elegant and innovative text incorporates the object-oriented design paradigm with Java as the implementation language. The result is a learning experience that provides the fundamental intuition and analysis of each structure studied. A Web site complete with Java applications and applets accompanies the text. Includes CD-ROM with... The Microsoft Visual J++ programming environment. |
From inside the book
Results 1-3 of 67
Page 659
... tree or of a graph ( for skip lists ) . In the worst case ( and also the average case ) , each node accessed for a query or update in one of these structures will be in a different block . Thus , these methods all ... b) Trees and B-Trees.
... tree or of a graph ( for skip lists ) . In the worst case ( and also the average case ) , each node accessed for a query or update in one of these structures will be in a different block . Thus , these methods all ... b) Trees and B-Trees.
Page 660
Michael T. Goodrich, Roberto Tamassia. a An ( a , b ) tree is a multi - way search tree such that each node has between a and b children and stores between a – 1 and b – 1 items . The algorithms for searching , inserting , and deleting ...
Michael T. Goodrich, Roberto Tamassia. a An ( a , b ) tree is a multi - way search tree such that each node has between a and b children and stores between a – 1 and b – 1 items . The algorithms for searching , inserting , and deleting ...
Page 662
... b ) tree T is realized by means of the data structure described in Section 13.1.3 , and the secondary structure of the nodes of T support search in f ( b ) time , and split and fusion operations in g ( b ) time , for some functions f ...
... b ) tree T is realized by means of the data structure described in Section 13.1.3 , and the secondary structure of the nodes of T support search in f ( b ) time , and split and fusion operations in g ( b ) time , for some functions f ...
Common terms and phrases
abstract addition algorithm allows analysis applet applications array associated assume binary tree block called chapter child Code Fragment consider constant container data structure defined deletion denote describe determine dictionary directed discuss edges efficient element empty enumeration equal example executed expression external Figure function give given graph heap height illustrate implementation important Input insertion integer interface internal node iteration Java justification locator loop means memory method Note object operations Output path pattern perform position priority queue problem Proposition protected queue random range rank recursive reference remove represent requires root running search tree sequence shown simple single sorting space specific stack stored string Table takes throw traversal variable vertex vertices visited void