Problem
1. Write a non-recursive version of the ID range program given in the text.
2. Write a program to print out all points from a binary tree that do not fall in a specified interval.
3. Give the maximum and minimum number of grid squares that will be searched in the grid method as functions of the dimensions of the grid squares and the search rectangle.