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.
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 zambiatek!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 zambiatek!
