Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / 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 |
Post New Answer View All Answers
What's the difference between a hashtable and a hashmap?
Why does hashset use hashmap?
What is sorted list in data structure?
Write the steps involved in the insertion and deletion of an element in the stack.
What are the applications of priority queues?
What are the disadvantages of linked list?
Can treemap have null values?
If you are given a choice to use either arraylist and linkedlist, which one would you use and why?
How do you separate zeros from non-zeros in an array?
How does hashset maintain order?
Which sorting technique is best in worst case?
Why insertion is faster in linked list?
How do you define a set?
What happens if we put duplicate key in hashmap?
How can we remove loops in a linked list? What are the functions of fast and slow pointers?
