what is R-B tree
- 4 Answers
- 9557 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 a complexity of linear search,binery search?
Does arraylist allow null values?
What is int data type?
What is a treemap used for?
What is arraylist load factor?
What is default size of hashmap?
What are the differences between b tree and b+ tree?
Define in brief an array.
What is max heapify?
write a program to accept name & sort them?
Why set will not allow duplicates?
Define the term “percolate up”?
Windows 
