Specifies the type of traveral performed by g_tree_traverse(),
g_node_traverse() and g_node_find().
G_IN_ORDER
vists a node's left child first, then the node itself,
then its right child. This is the one to use if you
want the output sorted according to the compare
function.
G_PRE_ORDER
visits a node, then its children.
G_POST_ORDER
visits the node's children, then the node itself.
G_LEVEL_ORDER
is not implemented for Balanced Binary
Trees. For N-ary Trees, it
vists the root node first, then its children, then
its grandchildren, and so on. Note that this is less
efficient than the other orders.
Specifies the type of traveral performed by g_tree_traverse(), g_node_traverse() and g_node_find(). G_IN_ORDER vists a node's left child first, then the node itself, then its right child. This is the one to use if you want the output sorted according to the compare function. G_PRE_ORDER visits a node, then its children. G_POST_ORDER visits the node's children, then the node itself. G_LEVEL_ORDER is not implemented for Balanced Binary Trees. For N-ary Trees, it vists the root node first, then its children, then its grandchildren, and so on. Note that this is less efficient than the other orders.