Rest of dictionary operations
Given an implementation of splay operation, rest of dictionary operations can be implemented easily:
- Lookup(K,T)
- Insert(K, Info, T)
- Delete (K,T)
- Concat(T1, T2):
- input -- two BST’s T1 and T2 such that every key in T1 is less than every key in T2
- output -- BST containing all keys in either T1 or T2