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 are the advantages of sorting and filtering data?
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
What are linked lists used for?
Does arraylist extend list?
What is the need for path compression?
Which sort is best for linked list?
What is map entry?
What is ds tree?
What are the types of data structures?
Write a Program for Insert in a sorted list
How to get largest and smallest number in an array?
How do you use merge sort?
What is array and string?
What is the difference between a hashmap and hashtable?
Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?
