An insertion technique for one-sided height-balanced trees
- 1 August 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 19 (8), 471-473
- https://doi.org/10.1145/360303.360334
Abstract
A restriction on height-balanced binary trees is presented. It is seen that this restriction reduces the extra memory requirements by half (from two extra bits per node to one) and maintains fast search capabilities at a cost of increased time requirements for inserting new nodes.Keywords
This publication has 2 references indexed in Scilit:
- Performance of height-balanced treesCommunications of the ACM, 1976
- Binary Search Trees and File OrganizationACM Computing Surveys, 1974