A Show That If All Nodes In A Splay Tree

a. Show that if all nodes in a splay tree are accessed in sequential order, the resulting tree consists of a chain of left children.
b. Show that if all nodes in a splay tree are accessed in sequential order, then the total access time is O(N), regardless of the initial tree.

Posted in Uncategorized