what is R-B tree
- 4 Answers
- 9531 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 |
Explain the implementation of an AVL tree and Binary tree.
How does selection sort work?
Briefly explain recursive algorithm?
Is null a binary search tree?
What are the advantages and disadvantages of linked list over array?
Why do we need sorting?
What is hash value of a string?
List the differences between comparable and comparator interface?
Which is faster hashmap or linkedhashmap?
How can avl tree be useful in all the operations as compared to binary search tree?
What can be stored in an arraylist?
Why do we use data structures?
Windows 
