problem 1:

Illustrate a class called binarySearchTree to represent the Binary search tree. Extend this class by adding the public method outputInRange (Low, High) that outputs, in rising order of key, all elements in the binary search tree whose key lies between Low and High. Use recursion and evade entering sub trees that can’t possibly contain any elements with keys in desired range.

problem 2:

Illustrate briefly about KMP algorithm with an illustration.

problem 3:

Illustrate the advantages and drawbacks of Tries.

problem 4:

What occurs in the hardware when I call a virtual function? How many layers of the indirection are there? How much overhead is there?