数据结构与算法

avl 左右子树的高度差小于等于 1。 其每一个子树均为平衡二叉树。 为了计算平衡因子，我们要在节点中引入高度这一属性。在这里，我们把节点的高度定义为其左右子树的高度的最大值。 红黑树 Red-Bla

intro Quicksort is popular because it is not difficult to implement, works well for a variety of dif

intro divide-and-conquer Mergesort is based on a simple operation known as merging: combining two or

Selection sort 每次遍历都要向后比较到最后一位 complexity Selection sort uses ~N2/2 compares and N exchanges to sort

Sort a nearly sorted (or K sorted) array https://www.geeksforgeeks.org/nearly-sorted-algorithm/ Give

Priority Queues: Heaps are commonly used to implement priority queues, where elements with higher pr

Treap is a Cartesian tree of (key,priority) pairs;it is heap-ordered according to the priority value

A RMQ on a sequence is equivalent to a lowest common ancestor query on the sequence’s Cartesian tree

rb trees provide faster insertion and removal operations than AVL trees