Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45463
Title: AN ALGORITHM FOR BALANCING BINARY TREES
Authors: Colijn, A.W.
Keywords: Computer Science
Issue Date: 1-Aug-1981
Abstract: An algorithm is presented for balancing binary trees; the algorithm re-structures in place any tree of arbitrary structure, to produce a tree with the property that the numbers of left and right descendants of any node differ by at most one. The algorithm is convenient to use, and it is fast; the time required to balance a tree varies linearly with the number of nodes. Experimental results and variations of the basic algorithm are discussed.
URI: http://hdl.handle.net/1880/45463
Appears in Collections:Colijn, Anton

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.