AN ALGORITHM FOR BALANCING BINARY TREES

Simple item page
dc.contributor.authorColijn, A.W.eng
dc.date.accessioned2008-02-26T20:30:33Z
dc.date.available2008-02-26T20:30:33Z
dc.date.computerscience1999-05-27eng
dc.date.issued1981-08-01eng
dc.description.abstractAn 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.eng
dc.description.notesWe 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 digitize@ucalgary.caeng
dc.identifier.department1981-68-20eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30565
dc.identifier.urihttp://hdl.handle.net/1880/45463
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleAN ALGORITHM FOR BALANCING BINARY TREESeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications