So, finding a key takes O(height) time, how much time does it take to find all nodes with a key greater than a given key? What are the constant factors?
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.
So, finding a key takes O(height) time, how much time does it take to find all nodes with a key greater than a given key? What are the constant factors?
If it will be done properly, you would probably find the key, and then go In-Order to the next ones.
So it will be O(logn) + m . Where m is the number of bugs greater than the key.
Worst case would be O(logn) + n = O(n)