Are there any applications of van Emde Boas trees besides as fast priority queues for integers?
Are there any applications of van Emde Boas trees besides as fast priority queues
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Are there any applications of van Emde Boas trees besides as fast priority queues for integers?
van Emde Boas trees can be used anywhere in place of a normal binary search tree so long as the keys in the search tree are integers in some fixed range. Thus for applications where you need to be able to find the integer in a set that is closest to some other integer, using a vEB-tree can potentially be faster than using a simple balanced binary search tree. As an example, of you have a linear layout of stores on some line and want to find the closest store to some particular customer, using a vEB-tree could make the search exponentially faster than the (already fast) BST.
Hope this helps!