二叉排序树在查找方面提供了很大的方便，但是对worst-case查找/插入/删除/求最值 得时间复杂度都为O(n).



红黑树可以保证在worst-case下查找/插入/删除等的复杂度得到O(lgN)。红黑树保持如下特性-Binary sort tree in the Find a great convenience, but worth the time complexity of O (n) worst-case lookup/insert/delete/demand. Red-black tree can guarantee to find the worst-case/the complexity of insert/delete O (lgN). Red-black tree to maintain the following characteristics