Interested to Buy Any Domain ? << Click Here >> for more details...
what is R-B tree
- 4 Answers
- 11305 Views
- Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
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 |
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 |
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 |
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 |
What is linear and non linear structure?
How can we delete the first node from the singly linked list?
Why do we need algorithm?
Reverse a linked list from the middle.
What are the types of array operations?
What is time complexity of sorting algorithms?
What is the difference between a hashmap and hashtable?
What is the bucket size, when the overlapping and collision occur at the same time?
How memory is reserved using a declaration statement in data structure?
What is the difference between collections class vs collections interface?
What do you mean by 2-3-4 tree?
Explain the Stack
Windows 
