A Show How To Implement The Merge Operation On Splay

a. Show how to implement the merge operation on splay trees so that any sequence of N−1 merges starting from N single-element trees takes O(N log2 N) time.
b. Improve the bound to O(N logN).

Posted in Uncategorized