Vidyalelo
Data Structure · Q225

Binary Search Trees(B Tree)

Programming · Data Structure · question 225

Q225

In which of the following self - balancing binary search tree the recently accessed element can be accessed quickly?

A.
AVL tree
B.
AA tree
C.
Splay tree
Answer
D.
Red - Black tree

Answer: Option C

Solution

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