Red-black tree is a self-balancing binarysearchtree.
红黑树 是一个自平衡的二叉查找树。
2
In the above example, a simple hashmap or binarysearchtree could have easily solved the problem, but implementing one of these data structures in XSL would be inconvenient and unnecessary.