A skip list is a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary se

最小最大堆的插入，删除，找最大最小值操作实现（写成C++库文件的形式，可在.cpp代码中直接调用）-MinMaxHeap, we can implement findMin and findMax in O(1) time and insert or delete in O(log n) time.