Thumbnail
Access Restriction
Subscribed

Author Kosaraju, S. Rao
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Binary search ♦ Avl trees ♦ Balanced trees ♦ Dynamic balancing
Abstract Recently Hirschberg has established that insertions into one-sided height-balanced trees can be done in O(log2N) steps. It is proved here that deletions can also be performed in O(log2N) steps, which answers the open problem posed by Hirschberg.
Description Affiliation: The John Hopkins Univ., Baltimore, MD (Kosaraju, S. Rao)
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 3
Page Count 2
Starting Page 226
Ending Page 227


Open content in new tab

   Open content in new tab
Source: ACM Digital Library