Thumbnail
Access Restriction
Subscribed

Author McDonald, M. A. ♦ Zweben, S. H.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Trees ♦ Balanced ♦ Search ♦ Binary
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.
Description Affiliation: Ohio State Univ., Columbus, OH (Zweben, S. H.) || Battelle Columbus Labs., Columbus, OH (McDonald, M. A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 21
Issue Number 6
Page Count 5
Starting Page 441
Ending Page 445


Open content in new tab

   Open content in new tab
Source: ACM Digital Library