Skip to content
Related Articles

Related Articles

Data Structures | Balanced Binary Search Trees | Question 12
  • Last Updated : 05 Feb, 2014

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)


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

Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :