TraverseType

class TraverseType

Specifies the type of traversal performed by traverse(), traverse() and 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

Fields

class TraverseType

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.

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.

POST_ORDER

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

PRE_ORDER

Visits a node, then its children.