Which statement about an AVL tree is correct?

Options

  • A. Every node has exactly two children
  • B. The balance factor of every node is -1, 0, or +1
  • C. All leaf nodes must be at the same level
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. The balance factor of every node is -1, 0, or +1

Detailed Explanation

An AVL tree does not require every node to have two children, and its leaf nodes do not necessarily have to be at exactly the same level. Its defining property is that the balance factor of every node must be -1, 0, or +1. This height-balance condition keeps the tree approximately logarithmic in height. AVL trees therefore provide O(log n) worst-case search, insertion, and deletion while preserving the Binary Search Tree ordering property.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts