Answer the following problems.

problem 1) describe in detail the primitive data structures.

problem 2) What are the demerits of a linear stack?

problem 3) prepare down the applications of linked lists.

problem 4) What are the procedure for binary tree representation?

problem 5) prepare the algorithm for Merge sort.

problem 6) prepare down the advantages of binary search over sequential search?

problem 7) Convert the following from infix expression to post-fix and pre-fix expression.

(A – B) + (C * (D – E)) / (E + F)

problem 8) What are the operations performed in a stack? Describe in detail .

problem 9) Describe in detail about binary tree representation.

problem 10) describe Quick sorts with suitable ex.

problem 11) Describe search techniques with ex.