Depth-First Traversal

In a depth-first traversal of a BearCLAW tree, a node's children are processed before its siblings. An example of this type of traversal is shown below:

and so on. In AMR terms, this method of traversal ensures that each grid's subgrids are all processed before moving on to any neighboring grids.