Red-black tree is a self-balancing binary search tree.
红黑树是一个自平衡的二叉查找树。
Difference between binary search and binary search tree?
二叉搜索和二叉搜索树之间的差异？
The results show that it is more effective than the binary search tree.
结果表明，它比二元查找树更为有效。
The results show that it is more effective than the binary search tree.
结果表明，它比二元查找树更为有效。
应用推荐