TraverseType

Description:

[ CCode ( cprefix = "G_" , has_type_id = false ) ]
public enum TraverseType

Specifies the type of traversal performed by g_tree_traverse, traverse and find.

The different orders are illustrated here:

In order: A, B, C, D, E, F, G, H, I <picture> <source srcset="Sorted_binary_tree_inorder-dark.svg" media="( prefers-color-scheme: dark)"> <img src="Sorted_binary_tree_inorder.svg" alt="Sorted binary tree, in-order traversal"> < /picture>
Pre order: F, B, A, D, C, E, G, I, H <picture> <source srcset="Sorted_binary_tree_preorder-dark.svg" media="( prefers-color-scheme: dark)"> <img src="Sorted_binary_tree_preorder.svg" alt="Sorted binary tree, pre-order traversal"> < /picture>
Post order: A, C, E, D, B, H, I, G, F <picture> <source srcset="Sorted_binary_tree_postorder-dark.svg" media="( prefers-color-scheme: dark)"> <img src="Sorted_binary_tree_postorder.svg" alt="Sorted binary tree, post-order traversal"> </picture>
Level order: F, B, G, A, D, I, C, E, H <picture> <source srcset="Sorted_binary_tree_breadth-first_traversal-dark.svg" media="(prefers-color-scheme: dark)"> <img src="Sorted_binary_tree_breadth-first_traversal.svg" alt="Sorted binary tree, breadth-first level order traversal"> </picture>

Namespace: GLib

Package: glib-2.0

IN_ORDER - visits a node's left child first, then the node itself, then its right child.
LEVEL_ORDER - is not implemented for [balanced binary trees](data-structures.
POST_ORDER - visits the node's children, then the node itself.
PRE_ORDER - visits a node, then its children.