Module: GLib::TraverseType

Defined in:

(unknown)

Constant Summary

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.

0 or :in_order

PRE_ORDER =

visits a node, then its children.

1 or :pre_order

POST_ORDER =

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

2 or :post_order

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.

3 or :level_order