Deletion in one-sided height balanced search trees
- 1 January 1978
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 6 (4), 265-271
- https://doi.org/10.1080/00207167808803145
Abstract
We give an deletion algorithm for one-sided height balanced search trees of n nodes. Thus deletion appears to be simpler than insertion, since Hirschberg's insertion algorithm is .Keywords
This publication has 1 reference indexed in Scilit:
- An insertion technique for one-sided height-balanced treesCommunications of the ACM, 1976