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 the similarity between a Structure, Union and enumeration?
Is it possible to increase size of array?
How do you empty an arraylist?
What is a node in it?
what is the primary advantage of a linked list?
What is difference between hashtable and hashmap?
List the types of tree.
What is list data structure?
Mention the steps to insert data at the starting of a singly linked list?
What is the space complexity of quicksort?
What is the minimum number of nodes in an avl tree of height h?
Is radix sort stable?