An Optimal Method for Deletion in One-Sided Height-Balanced Trees

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A one-sided height-balanced tree is a binary tree in which every node's right subtree has a height which is equal to or exactly one greater than the height of its left subtree. It has an advantage over the more general AVL tree in that only one bit of balancing information is required (two bits are required for the AVL tree).It is shown that deletion of an arbitrary node of such a tree can be accomplished in O(log n) operations, where n is the number of nodes in the tree. Moreover the method is optimal in the sense that its complexity cannot be reduced in order of magnitude. This result, coupled with earlier results by Hirschberg, indicates that, of the three basic problems of insertion, deletion, and retrieval, only insertion is adversely affected by this modification of an AVL tree. © 1978, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Zweben, S. H., & McDonald, M. A. (1978). An Optimal Method for Deletion in One-Sided Height-Balanced Trees. Communications of the ACM, 21(6), 441–445. https://doi.org/10.1145/359511.359514

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free