What is the essential difference between a red-black tree and a fourth-order B tree?

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?

Binary-tree algorithm data-structure

Mar.13,2021

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

Previous: Can Vuex's mutations and actions be understood as places where setter and getter are written respectively?

Next: Has Excel been timed out asynchronously using Redis?

MySQL Query : SELECT * FROM `codeshelper`.`v9_news` WHERE status=99 AND catid='6' ORDER BY rand() LIMIT 5
MySQL Error : Disk full (/tmp/#sql-temptable-64f5-1e47559-44c44.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
MySQL Errno : 1021
Message : Disk full (/tmp/#sql-temptable-64f5-1e47559-44c44.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
Need Help?