Multiple choice

Which of the following is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again?

  1. Red–black tree

  2. AVL tree

  3. Splay tree

  4. T-tree

  5. B-Tree
Reveal answer Fill a bubble to check yourself
C 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. For many sequences of non-random operations, splay trees perform better than other search trees, even when the specific pattern of the sequence is unknown.

Keep practicing — related questions