what is R-B tree
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 |
Differentiate between iterable and iterator.
Does concurrenthashmap allow null?
What is array traversing?
Define a set?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
State the difference between stacks and linked lists?
Write a Program for Insert in a sorted list
What are the major data structures used in the hierarchical data model?
What is heap and its types?
Is array part of collection framework?
Can treeset contain null?
How do you sort elements in an arraylist?