Computer Science, asked by sonysonu1169, 2 days ago

identify the valid red black tree

Answers

Answered by nikeetajohnson16
0

Rules That Every Red-Black Tree Follows:

Every node has a colour either red or black. The root of the tree is always black. There are no two adjacent red nodes (A red node cannot have a red parent or red child).

Answered by mk2241982
0

Answer:

binary Tree is a valid red black tree it is either Black or red.

Similar questions