## Linear lists and priority queues as balanced binary trees |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

ancestors average path length B-trees bal(q balance factors balanced trees BEGIN binary tree call to term cessor child concat concatenation Descend desired node dist dist(q empty subtree enqueuing Fibonacci tree fixdist fixless h(tr height h homeomorphic INFO insertion integer juncture node k-ary tree left subtree left-subtree sizes left(q LESS'S less(q linear list link(p,c MEANS NODE merging node q non-empty null then set number of nodes O(log(n operations ordered list trees otherwise set path length Pointer parameter position principal root principal subtree prio(q priority queue rebalancing REFERENCE NODE REFERENCE(NODE retrace right subtree right(p rightmost node rotation of degree search path set bal(p set diff Set q set up(q shorter subtree shorter tree side(q size(t stack steps subtree q symmetric order threaded tree threads tl and tr traversal tree algorithms tree of height tree tl units up(p up(t up(tt valid header