Interested to Buy Any Domain ? << Click Here >> for more details...
what is R-B tree
- 4 Answers
- 11313 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 quick sort?
What does the dummy header in linked list contain?
Is hashtable fail fast?
Define the graph data structure?
What are examples of data structures?
Why is hashset used?
Do you know what is linear search?
Describe binary tree and its property.
What do you mean by balance factor of a node in avl tree?
What is the best case for bubble sort?
Which is the simplest file structure?
What is linear-logarithm chasm?
Windows 
