Coldfresh的博客

这次节点的数据域增加了高度这个量，用来计算平衡因子，以此在插入的时候来调整树的结构 节点：struct node{ int val; int hei; node *l; node *r;};构造新节点node* newNode(int v){ node* Node=new node; Node->val=v; N...

There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 properties:(1) Every node is either red or black. (2) The root is black. (3) Every...