• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Top | MCQs on Advance Data Structure with Answers | Question 21

Which of the following statement is true about Red-Black Tree?

P1: Each Leaf Node and the root node of the Red-Black tree is Black.
P2:  The children of a Red node is Black.
P3: The children of a Black Node is Black.
P4: Two adjacent nodes can be Red.

(A)

P1 & P4

(B)

P2 & P3

(C)

P1 & P3

(D)

P1 & P2

Answer

Please comment below if you find anything wrong in the above post
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 geeks!

Last Updated :
Share your thoughts in the comments