8.4. Retrieving a Quadtree image   

The retrieval of an image represented in a quadtree is a simple recursive procedure.

Starting at the root of the tree, each node is examined in order. If the node is not a leaf, then it is traversed and its first child is examined. If this child is not a leaf then it is traversed and its first child is examined. When a leaf is encountered, the colour value is retrieved and displayed in the appropriate position. The traversal will then return to the parent and examine its second child.

This process continues until all leaves have been visited.

The entire image is displayed as soon as the tree is fully traversed in this manner.