Q. In which of the following self – balancing binary search tree the recently accessed element can beaccessed quickly? (Solved)

1. AVL tree

2. AA tree

3. Splay tree

4. Red – Black tree

  • c. Splay tree
Subscribe Now

Get All Updates & News