Variant code transformations for linear quadtrees
In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm has time and space complexities in O(l), where l is the length of the code of a BF or DF linear quadtree.
code transformation linear quadtree depth-first traversal breath-first traversal