Affiliation:
1. Louisiana State Univ., Baton Rouge
Abstract
A binary search tree can be globally balanced by readjustment of pointers or with a sorting process in O
(
n
)
time, n being the total number of nodes. This paper presents three global balancing algorithms, one of which uses folding with the other two adopting parallel procedures. These algorithms show improvement in time efficiency over some sequential algorithms [1, 2, 7] when applied to large binary search trees. A comparison of various algorithms is presented.
Publisher
Association for Computing Machinery (ACM)
Reference8 articles.
1. Multidimensional binary search trees used for associative searching
2. Iyengar S.S. and Chang H. Algorithms to create and maintain balanced and threaded binary search trees. Submitted for publication Software and Practice Journal November 1982. 10.1002/spe.4380151002 Iyengar S.S. and Chang H. Algorithms to create and maintain balanced and threaded binary search trees. Submitted for publication Software and Practice Journal November 1982. 10.1002/spe.4380151002
3. Iyengar S.S. and Chang H. A fast global algorithm to balance binary search trees. Submitted for publication 1984. Iyengar S.S. and Chang H. A fast global algorithm to balance binary search trees. Submitted for publication 1984.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献