Title :
New algorithms for balancing binary search trees
Author :
Haq, E. ; Cheng, Y. ; Iyengar, S.S.
Author_Institution :
Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
Abstract :
A simple iterative algorithm is presented for balancing an arbitrary binary search tree in linear time. An efficient parallel algorithm is developed from the iterative algorithm using shared memory model. The number of processors used is equal to N, the number of nodes in the tree. The proposed algorithm has time complexity of O(1)
Keywords :
computational complexity; iterative methods; parallel algorithms; trees (mathematics); binary search trees balancing; iterative algorithm; parallel algorithm; time complexity; Arithmetic; Binary search trees; Binary trees; Computer science; Iterative algorithms; Parallel algorithms; Phased arrays; Read-write memory; Tree data structures;
Conference_Titel :
Southeastcon '88., IEEE Conference Proceedings
Conference_Location :
Knoxville, TN
DOI :
10.1109/SECON.1988.194881
