A red-black tree is a kind of self-balancing binary search tree. Each node stores an extra bit, which we will call the color, red or black.
確定! 回上一頁