Specifies the type of traveral performed by GLib.Tree.traverse, GLib.Node.traverse and GLib.Node.find. The different orders are illustrated here: - In order: A, B, C, D, E, F, G, H, I ![](Sorted_binary_tree_inorder.svg) - Pre order: F, B, A, D, C, E, G, I, H ![](Sorted_binary_tree_preorder.svg) - Post order: A, C, E, D, B, H, I, G, F ![](Sorted_binary_tree_postorder.svg) - Level order: F, B, G, A, D, I, C, E, H ![](Sorted_binary_tree_breadth-first_traversal.svg)


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.


visits a node, then its children.


visits the node's children, then the node itself.


is not implemented for [balanced binary trees][glib-Balanced-Binary-Trees]. For [n-ary trees][glib-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.