Access Restriction

Author Pagli, Linda ♦ Luccio, Fabrizio
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Node insertion ♦ Binary search trees ♦ Search length ♦ Ipk trees ♦ Subtree rotation
Abstract The new class of Pk trees is presented, where height balance is maintained for the nodes lying on particular paths. The number of nodes of a Pk tree asympotically grows as a power of the height, in the worst case. A procedure for node insertion is given, and the class of trees considered is restricted to IPk trees, which are buildable by such a procedure. The average behavior of such trees, studied by an extensive set of simulation runs, is close to that of AVL trees. In particular, the family of IP0 trees whose main advantage is the reduced number of restructurings required after node insertion, is analyzed.
Description Affiliation: Univ. of Pisa, Pisa, Italy (Luccio, Fabrizio; Pagli, Linda)
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 11
Page Count 7
Starting Page 941
Ending Page 947

Open content in new tab

   Open content in new tab
Source: ACM Digital Library