Match the item on the left with the best description on the right.

Note: Use a choice only once.

An AVL tree

[ Choose ] has a tight Big-Oh search time of O(logN). will find the most recently accessed element in constant time.

A Splay tree

[ Choose ] has a tight Big-Oh search time of O(logN). will find the most recently accessed element in constant time.