Enumeration (GI Enum)

GLib-2.0 ▶ GLib ▶ TraverseType

Specifies the type of traversal performed by g_tree_traverse(), g_node_traverse() and g_node_find().

The different orders are illustrated here:

  • In order: A, B, C, D, E, F, G, H, I Sorted binary tree, in-order traversal
  • Pre order: F, B, A, D, C, E, G, I, H Sorted binary tree, pre-order traversal
  • Post order: A, C, E, D, B, H, I, G, F Sorted binary tree, post-order traversal
  • Level order: F, B, G, A, D, I, C, E, H Sorted binary tree, breadth-first level order traversal
Index

Enumeration Members

IN_ORDER LEVEL_ORDER POST_ORDER PRE_ORDER

Enumeration Members

IN_ORDER: number

visits 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.

LEVEL_ORDER: number

is not implemented for balanced binary trees. For n-ary trees, it visits the root node first, then its children, then its grandchildren, and so on. Note that this is less efficient than the other orders.

POST_ORDER

POST_ORDER: number

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

PRE_ORDER: number

visits a node, then its children.