authors 
Chang, Hsi and Iyengar, S. Sitharama 
year 
1984 
title 
Efficient Algorithms to Globally Balance a Binary Search Tree 
source 
Communications of the ACM. July, 1984. vol. 27: pp. 695702. includes bibliography 
summary 
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 when applied to large binary search trees. A comparison of various algorithms is presented 
keywords 
techniques, parallel processing, algorithms, search, sorting 
series 
CADline 
references 
Contenttype: text/plain

last changed 
2003/06/02 11:58 
