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
What is an expression tree?
What are splay trees?
What is the difference between hashmap and treemap?
What is reduction to sorting method?
Define indegree of a graph?
Can arraylist be resized?
What is variable size arrays?and why we use it?
Why null is not allowed in treemap?
Mention a few applications of linked lists?
How can I learn data structures?
Define static data structures?
What is basic data structure?
How do signed and unsigned numbers affect memory?
Is treeset sorted?
What is placement new in data structures?
