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 42
Page 96
... list as described in the previous section , deletions at the tail of the list cannot be done in constant time , even if we keep a reference to the tail node ... Linked Lists The Adapter Pattern Implementing Deques with Doubly Linked Lists.
... list as described in the previous section , deletions at the tail of the list cannot be done in constant time , even if we keep a reference to the tail node ... Linked Lists The Adapter Pattern Implementing Deques with Doubly Linked Lists.
Page 97
... doubly linked list . a It is easy to see that we can insert elements at both ends of a doubly linked list in O ( 1 ) time . ( See Figure 3.9 . ) Indeed , the prev links eliminate the need to traverse the list to get to the node just ...
... doubly linked list . a It is easy to see that we can insert elements at both ends of a doubly linked list in O ( 1 ) time . ( See Figure 3.9 . ) Indeed , the prev links eliminate the need to traverse the list to get to the node just ...
Page 119
... List I r = > A ranked sequence can also be implemented with a doubly linked list . ( See Section 3.4.4 . ) Of course , using this implementation means that we no longer explicitly store the ranks of the elements in the sequence . Hence ...
... List I r = > A ranked sequence can also be implemented with a doubly linked list . ( See Section 3.4.4 . ) Of course , using this implementation means that we no longer explicitly store the ranks of the elements in the sequence . Hence ...
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