Multiple choice

In which tree, for every node the heights of its left sub-tree and right sub-tree differ at least by one?

  1. Binary search tree

  2. AVL tree

  3. Complete tree

  4. Threaded binary tree
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The question is slightly misphrased, but it refers to the balancing condition of an AVL tree, which maintains the height difference between subtrees at most 1, not 'at least' by one.

Keep practicing — related questions