Answers were Sorted based on User's Feedback
Answer / 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|
Answer / vinaygupta.1989125
R-B tree is the combination of red black tree there is
always root node is black and child node are red
|Is This Answer Correct ?||31 Yes||9 No|
Answer / 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|
List out few of the Application of tree data-structure?
How do you separate zeros from non-zeros in an array?
Is Arraylist faster than Array? Why?
How do you find the second largest element in an array of integers?
What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
In what areas do data structures are applied?
How to find the missing element in integer array of 1 to 7?
State the merit of linked representation of binary trees?
What are the tasks performed during inorder traversal?
Stack can be described as a pointer. Explain.
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
How to check array contains value or not?