Open In App

Data Structures | Balanced Binary Search Trees | Question 9

Like Article
Like
Save Article
Save
Share
Report issue
Report

Which of the following is true about Red Black Trees?
(A) The path from the root to the furthest leaf is no more than twice as long as the path from the root to the nearest leaf
(B) At least one children of every black node is red
(C) Root may be red
(D) A leaf node may be red


Answer: (A)

Explanation: See http://en.wikipedia.org/wiki/Red%E2%80%93black_tree

Quiz of this Question


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads