Vidyalelo
Data Structure · Q175

Binary Search Trees(B Tree)

Programming · Data Structure · question 175

Q175

Cartesian trees are most suitable for?

A.
searching
B.
finding nth element
C.
minimum range query and lowest common ancestors
Answer
D.
self balancing a tree

Answer: Option C

Solution

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