A NEW WEIGHT BALANCED BINARY SEARCH TREE
2000 ◽
Vol 11
(03)
◽
pp. 485-513
◽
Keyword(s):
We develop a new class of weight balanced binary search trees called β-balanced binary search trees (β-BBSTs). β-BBSTs are designed to have reduced internal path length. As a result, they are expected to exhibit good search time characteristics. Individual search, insert, and delete operations in an n node β-BBST take O( log n) time for [Formula: see text]. Experimental results comparing the performance of β-BBSTs, WB(α) trees, AVL-trees, red/black trees, treaps, deterministic skip lists and skip lists are presented. Two simplified versions of, β-BBSTs are also developed.
Keyword(s):
2003 ◽
Vol 35
(2)
◽
pp. 363-376
◽
Keyword(s):
2010 ◽
Vol 19
(4)
◽
pp. 561-578
◽
Keyword(s):
Keyword(s):
2003 ◽
Vol 14
(03)
◽
pp. 465-490
◽
Keyword(s):
2016 ◽
Vol 26
(03)
◽
pp. 1650015
◽
Keyword(s):
Keyword(s):
1990 ◽
Vol 01
(04)
◽
pp. 449-463
◽
Keyword(s):
2010 ◽
Vol 19
(3)
◽
pp. 391-424
◽
2006 ◽
Vol DMTCS Proceedings vol. AG,...
(Proceedings)
◽
Keyword(s):