Q28
Which of the following is a characteristic of a perfectly balanced Binary Search Tree (BST)?
A.
The height of the tree is minimized.
AnswerB.
All nodes have exactly two children.
C.
All levels are completely filled except possibly the last.
D.
The left and right subtrees have equal number of nodes.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board