Some other standard questions:
1. Given a BST and a range, print all the numbers that comes in that range.
Ex: the function will be something like: print(node * head, int x, int y);
It has to print all numbers within the rage x&y
2. Print max height (level) of a binary search tree.
3. Given an array of integers, determine the sub array which makes max sum.
4. Find LCA of the binary search tree.