Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / 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 |
Post New Answer View All Answers
How do I remove a value from a list?
Is map a collection?
List out a few of the applications that make use of Multilinked Structures?
How does a treemap work?
Define linear probing?
What is a treemap chart?
What is map keyset?
What is the difference between hashset and arraylist?
What do you mean by complexity of search algorithm?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
Does treemap allow null key?
What is the difference between binary tree and binary search tree?
What do you mean by recursive definition?
What is an array vs list?
What do you mean by articulation point?
