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
D. Red – Black tree
Answer:C
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 D. Red – Black tree