Forest of Quadtrees have recently been recognized as an efficient data structure to store Quadtrees. Of special interest is the case in which a single 2**m by 2**m square region is contained in a 2**n by 2**n image. A study of the effect of placement of the square region inside the image was done to determine the usefulness of Forest of Quadtrees. The results indicate that a Forest of Quadtrees improves over the normal Quadtree for many positions of of the square region as the worst case occurs when both structures are equal. An analysis of the best and worst case positions will be presented.
