Difference between RB trees and B trees?

Question

Ben · Accepted Answer

A red-black tree is a self-balancing binary search tree.  It is guaranteed to always be balanced, but is complex to implement.

A B tree is a n-ary search tree in which each node has up to n-1 values and n children.

Tom · Answer

A red black tree is a binary search tree that is analogous to a B tree of order 4. B trees are k ary search trees in which each level has up to k children and each child has k-1 values.... something like that, I don't know how specific an answer they wanted

Pushpak rai · Answer

Red - black :- red black tree is binary tree representation of 2-4-3 tree. the child pointers in red- black tree is :- red and black...

B- tree :- b tree is the size of each node which can be made as large as the size of  the disk.. block size varies of each system

Pushpak · Answer

Red - black :- red black tree is binary tree representation of 2-4-3 tree. the child pointers in red- black tree is :- red and black...

B- tree :- b tree is the size of each node which can be made as large as the size of the disk.. block size varies of each system

Anonymous · Answer

I forgot

Google

Google interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches