Computer Science, asked by renuka7931, 7 months ago

Match the following and select the correct option.
1
a
o( log2n+)7-1 )
Height of Binary
search tree(in worst
case)
2
Height of Temary tree b
O(n)
3
C
Height of B-tree(when
minimum degree, 1–2)
O(log, (n))
4
d
Height of red-black
tree
olog
2​

Answers

Answered by pankajpankaj5227
12

Answer:

3 is a correct answer

Explanation:

i thanks

Similar questions