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
Which is faster hashmap or linkedhashmap?
What is the default capacity of hashmap?
Which of the collections allows null as the key?
Is it possible to increase size of array?
Define heap order property?
Why would you use a linked list?
Is list a data structure?
State the properties of a binary tree?
State the difference between queues and linked lists?
Which interfaces are implemented by hashmap?
How do you sort an array by value?
What is the Role of push() and pop() method?
Define distributed query and linked server?
What is ds heap sort?
Is list same as array?
