The concept of distance used in binary array representations of images is adapted to a quadtree representation. The Chessboard distance metric is shown to be particularly suitable for the quadtree. A Chessboard distance transform for a quadtree is defined as the minimum distance in the plane from each BLACK node to the border of a WHITE node. An algorithm is presented which computes this transform by only examining the BLACK node's adjacent and abutting neighbors and their progeny. Analysis of the algorithm shows that its average execution time is proportional to the number of leaf nodes in the quadtree.