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
Why quicksort is better than merge sort?
Define the term “percolate up”?
Which is faster array or arraylist?
How many types of arrays are there in visual basic?
How is hashmap o 1?
Why is sorting necessary?
Why sorting is used?
Can array store heterogeneous data?
What is a stable sort?
Can we put null key in hashmap?
How does insertion sort works?
When should structures be passed by values or by reference?
Can we give size to arraylist?
How do you represent a linked list?
Does arraylist maintain insertion order?
