Splay Trees: Self-Adjusting Binary Search Trees
Introduction A Binary Search Tree (BST) is defined as follows: An empty tree is a BST. If the left subtree of a BST is non-empty, all keys in the left subtree are less than the root's key. If the right subtree of a BST is non-empty, all keys in the right subtree are greater than the root's key. Both...