Q1. Describe the boundary tag method and prepare down a C program for freeing memory blocks.
Q2. When a binary search tree with n nodes is well balanced, illustrate the approximate number of comparisons of keys required to find out a target? Determine the number if the tree degenerates to a chain?
Q3. prepare detail note on any three of the given:
a) Circular queue and priority queue
b) Huffman trees
c) Shell sort
d) Game trees
Q4. With an illustration, describe the working of heap sort algorithm.
Q5. prepare down a function in C program which traverses a threaded binary tree in preorder.
Q6. prepare down an algorithm to find out the number of nodes in given binary tree?
Q7. For the given input list of numbers:
14, 15, 4, 9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14, 5
Determine the binary search tree?
Q8. State the two significant differences between a pointer and the array?