In an AVL tree, what is the maximum allowed difference in height between the left and right subtrees of any node?

Show answer

One

AVL trees are strict height-balanced binary search trees. If a modification causes the height difference (the balance factor) to exceed one, rotations are performed to rebalance the tree and maintain O(log n) performance.

Also asked as:

What is the maximum balance factor (height difference) allowed for any node in an AVL tree before it requires rebalancing?

Would you remember this in 6 months?

Trivia Forge uses spaced repetition so facts stick. Free, no signup needed.

Turn on Algorithms practice →

More Algorithms trivia

In hash tables, what is the name of the collision resolution technique where each bucket contains a pointer to a linked list of records?
In the context of NP-completeness, what is the term for a problem that is at least as hard as the hardest problems in NP, but might not be in NP itself?
In the context of optimization, what is the primary difference between the items in the Fractional Knapsack problem versus the 0/1 Knapsack problem?
In the context of the Ford-Fulkerson method, what is a path from the source to the sink in the residual graph called?
In the Master Theorem formula T(n) = aT(n/b) + f(n), what does the constant 'a' represent?
In the Master Theorem, what is the asymptotic solution for the recurrence T(n) = 4T(n/2) + n?

See all 83 →