This assignment has four questions which carry 80 marks. Answer all the questions. Each question carries 20 marks. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide. All the implementations should be in C language.

Q1. Write an algorithm that accepts a Binary Tree as input and prints the number of leaf nodes to standard output.

Q2. Write an algorithm for the implementation of a AVL Tree.

Q3. Write a note of not more than 5 pages summarizing the latest research in the area of “Trees”. Refer to various journals and other online resources. Indicate them in your assignment.

Q4. Write an algorithm for the implementation of a Stack.