Multiple choice

Which of the following tree data structures has the property that recently accessed elements are quick to access again?

  1. link/cut tree

  2. AVL tree

  3. T-tree

  4. splay tree

  5. finger tree
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log n) amortized time.

Keep practicing — related questions