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 many times is merge sort called?
What is the use of data structure?
What are the different types of data structures explain briefly?
What is difference between an Array and ArrayList?
What is the difference between hashset and treeset?
What is a circular singly linked list?
What is difference between list and array list?
How does threaded binary tree represented in data structure?
What is linear and non linear structure?
Tell me about the different sorting techniques.
How does a hashtable work?
How to sequentially represent max-heap?
What is the difference between hashmap and treemap?
What is a directed graph?
Define a complete binary tree?
