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.
What is the Big O efficiency of the AVL tree rotation specifically?
For example when inserting:
– O(logN) to search for the position
– O(1) to insert
– ? for balancing (if it needs to be re-balanced)
I thought it would be O(logN) but I found a site which claims it’s O(1) – unless I have misread it – http://users.informatik.uni-halle.de/~jopsi/dinf504/chap4.shtml
(Would this also be the same for a 2-3 tree?)
Thanks for the help in advance
The complexity is O(log n) as you say. I believe that in the article they mean constant time for each rebalancing operation i.e. each rotation, while you have to do O(log n) rotations. Whatever the truth the complexity is as you say logarithmic.