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 |
What is merge sort and how it works?
What is binary tree and its properties?
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
No. of possible ordered trees with n nodes ? Please give formula (if any).
Is binary tree balanced?
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?
Why might quick sort might be better than merge sort?
What are priority queues?
What is data structure and why it is important?
What are the 3 types of variables?
Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree.
Is treemap synchronized?