what is R-B tree
- 4 Answers
- 9896 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 what are the types of collision resolution techniques and the methods used in each of the type?
What is red black tree in data structure?
Explain what is the data structures used to perform recursion?
What is the meaning of arraylist?
What is difference between hashmap and linkedhashmap?
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
Discuss how to implement queue using stack.
How does a hashtable work?
Can arraylist be empty?
What is inserting in data structure?
In which matrix, we can use multilinked structures?
Does arraylist shrink?
Windows 
