【数据结构与算法】伸展树的Java实现

SplayTree

@see SplayTree

SplayTree功能介绍

• void insert(x) → Insert x
• void remove(x) → Remove x
• boolean contains(x) → Return true if x is found
• Comparable findMin() → Return smallest item
• Comparable findMax() → Return largest item
• boolean isEmpty() → Return true if empty; else false
• void makeEmpty() → Remove all items

异常类

当集合容器为空的时候就不能够删除或获取元素，这时就会出现一种异常，命名为UnderflowException：

/**
 * Exception class for access in empty containers
 * such as stacks, queues, and priority queues.
 */
public class UnderflowException