Vidyalelo
Data Structure · Q131

Binary Search Trees(B Tree)

Programming · Data Structure · question 131

Q131

Why do we impose restrictions like . root property is black . every leaf is black . children of red node are black . all leaves have same black

A.
to get logarithm time complexity
Answer
B.
to get linear time complexity
C.
to get exponential time complexity
D.
to get constant time complexity

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board