### Enumeration

# GLib TraverseType

since: 2.0

#### Declaration

    enum GLib.TraverseType

#### Description

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 - Pre order: F, B, A, D, C, E, G, I, H - Post order: A, C, E, D, B, H, I, G, F - Level order: F, B, G, A, D, I, C, E, H

Available since: 2.0

#### Members

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

  - Value: `0`
  - Nickname: `None`
  - Available since: 2.0
`G_PRE_ORDER`

  Visits a node, then its children.

  - Value: `1`
  - Nickname: `None`
  - Available since: 2.0
`G_POST_ORDER`

  Visits the node’s children, then the node itself.

  - Value: `2`
  - Nickname: `None`
  - Available since: 2.0
`G_LEVEL_ORDER`

  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.

  - Value: `3`
  - Nickname: `None`
  - Available since: 2.0