Van Emde Boas Trees. Elif Tosun (252a-aa) CSC 252 – Final Project. Outline . Introduction “Silly” Priority Queue Stratified Tree Structure Operations on the Stratified Tree Structure Conclusions My Contribution References. Introduction. Main problem in operations for Set Manipulation
Elif Tosun (252a-aa)
CSC 252 – Final Project
2-3 trees, etc.
T(n) = T(n^(1/2)) + 1
Note: For some operations to be done in O(1) nodes are prevented from being active unless needed.
Let v be a present internal node.
V is active there exists a branchpoint in the interior of the reach of v.
Note: a leaf is active it’s present
root is active set null
If (no present leaves exists on l’s side of the tree)
insert as before
compute the fathers of l(=hl) and
the present leaf p (=hp).
if no branchpoint exists on l’s side of CS
hp is present without being active.
hl is present iff hp = hl
if hl is present
insert l under hp = hl
if hl is not present
insert l as a leaf to a node
If a branch point does exist on l’s side of CS
hl is present iff it’s active
if hl is active
insert leaf as a child to hl
if hl is not active
insert leaf as a child to a node
Makes a leaf non-present as well as its ancestors up to the lowest branch point.