1 / 20

What is an AVL tree and why is it balanced?

?

A self-balancing binary search tree with height difference at most 1 between left and right subtrees, ensuring O(log n) height

Subscribe

Get the latest from Examzify

You can unsubscribe at any time. Read our privacy policy