Data Structure Tree Question #5629
MCQ Single Best Answer Easy

QWhat is a height-balanced tree?

ID: #5629 Tree 120 views
Question Info
#5629Q ID
EasyDifficulty
TreeTopic

Choose the Best Option

Click any option to instantly check if you're correct.

  • A A tree in which each node has at most one child
  • B A tree in which each node has exactly two children
  • C A tree in which the difference in height between the left and right subtrees of any node is at most 1
  • D A tree in which the difference in height between the left and right subtrees of any node is at most 2
Correct Answer: Option C

Explanation

Answer: c) A tree in which the difference in height between the left and right subtrees of any node is at most 1

Share This Question

Challenge a friend or share with your study group.