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 ∣ ) O(|U|) O(∣U∣) space predecessor/s
相关文章
相关标签/搜索