The.Algorithm.Design.Manual.Springer-Verlag.1998

Priority Queues
Repeatedly traversing left (or right) pointers until we hit a leaf takes time proportional to the height of the tree, or if the
tree is balanced. The insert operation can be implemented exactly as binary tree insertion. Delete-Min can be implemented by
finding the minimum element and then using standard binary tree deletion. It follows that each of the operations can be
performed in time.
Priority queues are very useful data structures. Indeed, they are the hero of the war story described in Section . A complete
set of priority queue implementations is presented in Section .
Next: Specialized Data Structures Up: Fundamental Data Types Previous: Binary Search Trees
Algorithms
Mon Jun 2 23:33:50 EDT 1997
file:///E|/BOOK/BOOK/NODE27.HTM (2 of 2) [19/1/2003 1:28:25]