AN ALGORITHM FOR BALANCING BINARY TREES

Thumbnail Image

Date

1981-08-01

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

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.

Description

Keywords

Computer Science

Citation

URI

http://hdl.handle.net/1880/45463

Collections

Science Research & Publications

Endorsement

Review

Supplemented By

Referenced By

Powered by

Libraries & Cultural Resources

Start Something.

University of Calgary
2500 University Drive NW
Calgary Alberta T2N 1N4
CANADA

Copyright © 2023

The University of Calgary, located in the heart of Southern Alberta, both acknowledges and pays tribute to the traditional territories of the peoples of Treaty 7, which include the Blackfoot Confederacy (comprised of the Siksika, the Piikani, and the Kainai First Nations), the Tsuut’ina First Nation, and the Stoney Nakoda (including Chiniki, Bearspaw, and Goodstoney First Nations). The City of Calgary is also home to the Métis Nation of Alberta (Districts 5 and 6).

The University of Calgary is situated on land Northwest of where the Bow River meets the Elbow River, a site traditionally known as Moh’kins’tsis to the Blackfoot, Wîchîspa to the Stoney Nakoda, and Guts’ists’i to the Tsuut’ina. On this land and in this place we strive to learn together, walk together, and grow together “in a good way.”