AVL · RR

An AVL tree keeps every node’s left and right subtree heights within one level using rotations.

Remember: This case: rotate left.

Example: 10,20,30 → balanced root 20, children 10 and 30.

Time: O(log n) / insert. Auxiliary space: O(log n).

Formula: BF = height(left) − height(right); height = 1 + max(left, right)

Insert up to 15 keys in order; duplicates are ignored. Empty height = 0, leaf height = 1. Presets demonstrate the named case; custom inputs may trigger other cases. Building n keys takes O(n log n), with O(n) tree storage. Recursive auxiliary space excludes the tree. Deletion is not included.

Complexities describe the underlying algorithm; tutorial snapshots and rendering can use additional resources.

The interactive workspace loads here when JavaScript is available. You can still browse the learning notes and links above without it.