The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
A comparison of tree-balancing algorithms
Communications of the ACM
Performance of height-balanced trees
Communications of the ACM
An insertion technique for one-sided height-balanced trees
Communications of the ACM
Communications of the ACM
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
A compendium of key search references
ACM SIGIR Forum
Balancing binary trees by internal path reduction
Communications of the ACM
| Hi-index | 48.23 |
The new class of Pk trees is presented, where height balance is maintained for the nodes lying on particular paths. The number of nodes of a Pk tree asympotically grows as a power of the height, in the worst case. A procedure for node insertion is given, and the class of trees considered is restricted to IPk trees, which are buildable by such a procedure. The average behavior of such trees, studied by an extensive set of simulation runs, is close to that of AVL trees. In particular, the family of IP0 trees whose main advantage is the reduced number of restructurings required after node insertion, is analyzed.