what is R-B tree




Answers were Sorted based on User's Feedback



what is R-B tree..

Answer / saurabh gupta

A red black tree is a binary tree where every node has
color.root node is always black , the child of a black node
either.black or red and the child node of every red node
must be black

Is This Answer Correct ?    24 Yes 0 No

what is R-B tree..

Answer / vinaygupta.1989125

R-B tree is the combination of red black tree there is
always root node is black and child node are red

Is This Answer Correct ?    31 Yes 9 No

what is R-B tree..

Answer / anupam

A red black tree is a binary tree where
1. every node has color.
2. root node is always black
3. the child of a black node is either black or red
4. both the child nodes of every red node must be black
5. all the leaves must be black

Is This Answer Correct ?    7 Yes 1 No




what is R-B tree..

Answer / santosh kumar chaudhary

Anupam all your points are right except the last one ,the
last point should be all the leaf node must be red...

Is This Answer Correct ?    0 Yes 0 No

Post New Answer



More Data Structures Interview Questions

What are the types of queues?

0 Answers  


What is a list of lists?

0 Answers  


Why is data structure needed?

0 Answers  


Define the term “percolate up”?

0 Answers  


Explain pre-order and in-order tree traversal.

0 Answers  






What are the advantages of linked list over array (static data structure)?

0 Answers  


Differentiate between queue and stack.

0 Answers  


What is a Queue? Explain its operation with example?

0 Answers  


How to reverse a linked list iterative algorithm?

0 Answers  


Differentiate between file and structure storage structure.

0 Answers  


Write an algorithm that counts number of nodes in the circular linked list

0 Answers  


What method is used to place a value onto the top of a stack?

0 Answers  






Categories