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.
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at firstname.lastname@example.org