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|
What are the types of queues?
What is a list of lists?
Why is data structure needed?
Define the term “percolate up”?
Explain pre-order and in-order tree traversal.
What are the advantages of linked list over array (static data structure)?
Differentiate between queue and stack.
What is a Queue? Explain its operation with example?
How to reverse a linked list iterative algorithm?
Differentiate between file and structure storage structure.
Write an algorithm that counts number of nodes in the circular linked list
What method is used to place a value onto the top of a stack?