úξ*      !"#$%&'()*+O(1). 1 constructs a splay tree containing one element. O(1). ! constructs an empty splay tree. O(1). ( returns true if a splay tree is empty. Amortized O(lg n) . Given a splay tree and a key,   attempts to find a node with the specified key and splays this node to the root. If the key is not found, the nearest node is brought to the root of the tree. Amortized O(lg n)+. Given a splay tree and a key-value pair, 1 places the the pair into the tree in BST order. O(1). ) returns the key-value pair of the root. Amortized O(lg n). 6 removes the root of the tree and merges its subtrees ,- O(n lg n)D. Constructs a splay tree from an unsorted list of key-value pairs.  O(n lg n)T. Constructs a splay tree from a list of key-value pairs sorted in ascending order.  O(n lg n)W. Converts a splay tree into a list of key-value pairs with no constraint on ordering.  O(n lg n).  O converts a splay tree to a list of key-value pairs sorted in ascending order.      ./ 012    3456789O(1). O(lg n) O(lg n). :;O(lg n) O(lg n) O(n) < O(n lg n)    =>?!O(1). ! produces an empty heap. "O(1). "6 consumes an element and constructs a singleton heap. ##, consumes two binary heaps and merges them. $O(lg n). %O(1). & O(n lg n). 'O(n). '1 constructs a binary heap from an unsorted list. @(O(1). (' returns the element root of the heap. )O(lg n). )8 discards the root of the heap and merges the subtrees. !"#$%&'() ()#"!%'&$ !"#$%&'()A                  !"#$%TreeStructures-0.0.1Data.Tree.SplayData.Heap.SkewData.Heap.BinomialData.Heap.Binary SplayTree singletonemptynulllookupinsertheadtailfromList fromAscListtoList toAscListSkewHeapmerge BinomialHeap BinaryHeapLeaf splayRight splayLeftSkewLeafcutRightassemblepairWiseHeap EmptyHeapHeapNoderankhRankextract mergeNodescombineNode