Data Structures | Balanced Binary Search Trees | Question 12

Is the following statement valid?

A Red-Black Tree which is also a perfect Binary Tree can have all black nodes
(A) Yes
(B) No


Answer: (A)

Explanation:

A perfect BST with all black nodes doesn’t violate any of the Red-Black tree properties.

Quiz of this Question

My Personal Notes arrow_drop_up

Save