Total questions 23
MCQs = 16

2 Marks each
Q) Traverse following tree in In-order and Post-order
15
2 11
Q) What is function call stack.
Q) Differentiate b/w call by reference and call by value.

3 Marks each
Q) What normally is the sequence of operation while constructing an AVL Tree.
Q) Draw BST that is as tall as possible.
2, 6, 5, 4, 7, 9, 8

5 Marks each
Q) Write a recursive function in C++ that computes the number of leaves in a binary tree, We will pass pointer to root of the tree to that function in leaf count (Node * root).
{
…..
}

Q) Suppose that following is a balanced AVL Tree , Insert new node P into tree. Then the resulting tree may or may not remain balanced.
__diagram__