A red-black tree can be equivalent to a fourth-order B-tree, and all kinds of operations of the fourth-order B-tree can be completed in log (n) time, so what is the meaning of the red-black tree? Or is there such an essential difference between them that they need to redefine a new data structure?
read the article you gave me. I don't think there is an essential difference in performance.
but in terms of simplicity, the binary tree must be simpler than the multi-forked tree, which is why the red-black tree is more widely used than the so-called fourth-order B-tree in the search tree.
the red-black tree is a binary tree, and the B-tree is a multi-forked tree. As for the fourth-order B-tree you mentioned, it is not clear what kind of variation it is
.