Splay Tree Search
Splay Tree Search Splay tree search looks up a key in a binary search tree and then restructures the tree by moving the accessed node, or the last visited node, to the root. This restructuring is called splaying. It improves future access to recently used keys and gives amortized logarithmic performance without storing balance metadata such as heights, colors, or priorities. Problem Given a splay tree with root root and...