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 the prerequisite for binary searching?
Is bubble sort faster than selection sort?
Why sorting algorithms are important?
How do you implement a stack?
What is the difference between hashmap and linkedhashmap?
What is the difference between arraylist and linkedlist?
What data structure underlies a python list?
What are stacks? Give some of its applications.
What is difference between treeset hashset linkedhashset?
How will you free the memory that is allocated at run time?
What are different methods of collision resolution in hashing.
What is adt and its advantages?
Questions related to arrays, such as given a 2 integer array, find the common elements.
Explain how is linked list implemented?
What does the dummy header in the linked list contain?
