Vidyalelo
Data Structure · Q209

Binary Search Trees(B Tree)

Programming · Data Structure · question 209

Q209

When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?

A.
no there is no special usage
B.
In real time it is estimated that 80% access is only to 20% data, hence most used ones must be easily available
Answer
C.
redblack and avl are not upto mark
D.
they are just another type of self balancing binary search trees

Answer: Option B

Solution

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