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
Describe full binary tree and complete binary tree.
How can we reverse a singly linked list?
Define distributed query and linked server?
What is a weighted graph?
Define the tree data structure.
What is sorting in math?
Define non-terminal nodes in a tree?
What is difference between hashset and treeset?
Why do we use collections?
What is bubble sort in data structure?
What is the use of sorting the data?
What are the 4 types of data?
What is adt and its advantages?
Is it possible to insert different type of elements in a stack? How?
Write an algorithm to show the postfix expression with the input given as : a b + c d +*f ? .
