About this question
Medium · data_structures · Quant Developer interview question · van-emde-boas, successor-query, sorted-set, data_structures, tick-price, upper-bound
A Van Emde Boas (VEB) tree provides highly efficient successor queries on discrete integer universes, a common requirement for tick price data in quantitative finance. These queries are critical for tasks like best-fill-price estimation and optimal order routing. This problem simulates the VEB tree's successor functionality using a std::set to master the underlying upper_bound search logic. Task Implement the insert(int price) and successor(int query) methods for the VEBTree class. The insert m