<para>
Specifies the type of traveral performed by g_tree_traverse(),
g_node_traverse() and g_node_find().
-<itemizedlist>
-<listitem><para>
-%G_PRE_ORDER visits a node, then its children.
-</para></listitem>
-<listitem><para>
-%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.
-</para></listitem>
-<listitem><para>
-%G_POST_ORDER visits the node's children, then the node itself.
-</para></listitem>
-<listitem><para>
-%G_LEVEL_ORDER is not implemented for
-<link linkend="glib-Balanced-Binary-Trees">Balanced Binary Trees</link>.
-For <link linkend="glib-N-ary-Trees">N-ary Trees</link>
-it calls the function for each child of the node, then it recursively visits
-each child.
-</para></listitem>
-</itemizedlist>
-</para>
-
-@G_IN_ORDER:
-@G_PRE_ORDER:
-@G_POST_ORDER:
-@G_LEVEL_ORDER:
+</para>
+
+@G_PRE_ORDER: visits a node, then its children.
+@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.
+@G_POST_ORDER: visits the node's children, then the node itself.
+@G_LEVEL_ORDER: is not implemented for
+ <link linkend="glib-Balanced-Binary-Trees">Balanced Binary Trees</link>.
+ For <link linkend="glib-N-ary-Trees">N-ary Trees</link>, 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.
<!-- ##### FUNCTION g_tree_search ##### -->
<para>
@search_func:
@user_data:
@Returns:
-<!-- # Unused Parameters # -->
-@data:
<!-- ##### FUNCTION g_tree_remove ##### -->