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.
Is there an efficient (log n) data structure that allows the following operations:
The number of elements is known and will not change during lifetime.
You could implement a balanced binary tree like a Red-Black Tree
A Red-Black tree has O(log(n)) time complexity for search, insertion and deletion.
You will have to make some modification to return the smallest element that is greater or equal to a given key. But the basic behavior is provided by this data structure I guess.