Which one of the following property is correct for a red-black tree?
Every simple path from a node to a descendant leaf contains the same number of black nodes
If a node is red, then one children is red and another is black
If a node is red, then both its children are red
Every leaf node (sentinel node) is red
This question is part of this quiz :
Top MCQs on Binary Trees Data Structure with Answers,ISRO CS 2017 December,Data Structures PYQ ISRO QUIZ