*
* Recursively copies a #GNode and its data.
*
- * Return value: a new #GNode containing copies of the data in @node.
+ * Returns: a new #GNode containing copies of the data in @node.
*
* Since: 2.4
**/
* then its right child. This is the one to use if you
* want the output sorted according to the compare
* function.
- * <informalfigure>
- * <mediaobject>
- * <imageobject>
- * <imagedata align="right" fileref="Sorted_binary_tree_inorder.svg" format="SVG"/>
- * </imageobject>
- * <caption>In order: A, B, C, D, E, F, G, H, I</caption>
- * </mediaobject>
- * </informalfigure>
* @G_PRE_ORDER: visits a node, then its children.
- * <informalfigure>
- * <mediaobject>
- * <imageobject>
- * <imagedata align="right" fileref="Sorted_binary_tree_preorder.svg" format="SVG"/>
- * </imageobject>
- * <caption>Pre order: F, B, A, D, C, E, G, I, H</caption>
- * </mediaobject>
- * </informalfigure>
* @G_POST_ORDER: visits the node's children, then the node itself.
- * <informalfigure>
- * <mediaobject>
- * <imageobject>
- * <imagedata align="right" fileref="Sorted_binary_tree_postorder.svg" format="SVG"/>
- * </imageobject>
- * <caption>Post order: A, C, E, D, B, H, I, G, F</caption>
- * </mediaobject>
- * </informalfigure>
* @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.
- * <informalfigure>
- * <mediaobject>
- * <imageobject>
- * <imagedata align="right" fileref="Sorted_binary_tree_breadth-first_traversal.svg" format="SVG"/>
- * </imageobject>
- * <caption>Level order: F, B, G, A, D, I, C, E, H</caption>
- * </mediaobject>
- * </informalfigure>
+ * [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.
*
* Specifies the type of traveral performed by g_tree_traverse(),
- * g_node_traverse() and g_node_find().
+ * 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_inorder.svg)
+ * - Pre order: F, B, A, D, C, E, G, I, H
+ * ![](Sorted_binary_tree_preorder.svg)
+ * - Post order: A, C, E, D, B, H, I, G, F
+ * ![](Sorted_binary_tree_postorder.svg)
+ * - Level order: F, B, G, A, D, I, C, E, H
+ * ![](Sorted_binary_tree_breadth-first_traversal.svg)
*/
/**