van Emde Boas Trees(vEB树)(Introduction to Algorithms, 算法导论，CLRS)学习笔记

van Emde Boas Trees

1. Predecessor search/ordered sets

• predecessor: return the nearest left neighbor
• successor: return the nearest right neighbor

2.Naive: $O(|U|)$ space

• predecessor/successor: if $x\in S$ then it’s $O(1)$;
• insert: worst case: $O|U|$; compare with all elements; lucky case smaller than the min or bigger than the max.

3. Twolevel: $O(|U|)$ space

• predecessor/successor: worst case: loop over the cluster of one summary, and the length of the cluster is half of the length of the original number, which is $w/2$. And since for each position in the binary there could be 1