Data Structure

Q1. Visiting root node after visiting left and right sub-trees is called Post-order Traveral.

Q2. It is not a criteria of algorithm.

Q3. Which data structure allows deletions at the both ends of the list but insertions at only one end?

Q4. What is the application of quick sort?

Q5. What is the application of Binpackingproblem?

Q6. What is the application of merge sort?

Q7. In which of these, the memoization is used for?

Q8. The data structure that allows deleting data elements from front and inserting at rear.

Q9. What do you mean by merge sort?

Q10. Which is procedure for step-by-step for calculations?