Locally balanced binary trees
Open Access
- 1 January 1976
- journal article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 19 (4) , 322-325
- https://doi.org/10.1093/comjnl/19.4.322
Abstract
The implementation of locally balanced binary search tree construction is described. Empirical investigation reveals that locally balanced trees are either superior or inferior to other more recent methods available in the literature, depending upon the chosen measurement criteria.Keywords
This publication has 0 references indexed in Scilit: