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
How do you explain bubble sort?
What is the difference between array and stack?
What is stable sort?
Can you sort a hashset?
What is the Difference between sax and dom parser?
How do you define a set?
How would you reverse characters of an array without using indexing in the array.
What is the need for priority queue?
What is sort function?
Does hashmap allow null keys?
Why hashtable is faster than arraylist?
What is the difference between an array and vector?
What will happen if an array goes out of bounds?
What is linked list ?
What is arraylist load factor?
