# HG changeset patch
# User Mike Becker <universe@uap-core.de>
# Date 1743718208 -7200
# Node ID d016fe8a647c587c873185e9d78a86358fd085c8
# Parent  e9c0ad32768410d55f8be4de4a4c91ea55ceab18
refine parts of the tree documentation

relates to #451

diff -r e9c0ad327684 -r d016fe8a647c docs/Writerside/topics/tree.h.md
--- a/docs/Writerside/topics/tree.h.md	Thu Apr 03 23:59:31 2025 +0200
+++ b/docs/Writerside/topics/tree.h.md	Fri Apr 04 00:10:08 2025 +0200
@@ -112,6 +112,8 @@
 
 ### Example for wrapping a libxml2 tree
 
+In this example we wrap the XML tree of the commonly used libxml2 library.
+
 ```C
 #include <libxml/tree.h>
 #include <cx/tree.h>
@@ -299,16 +301,21 @@
 There are two different kind of iterators for trees.
 The `CxTreeIterator` is performing a depth-first iteration with the capability of visiting a node twice:
 first when the iterator enters the node coming from its parent, and secondly when the iterator tracks back from its last child.
+This behavior is controlled via the `visit_on_exit` argument.
+When set to `true`, the iterators `exiting` flag can be checked during iteration to see whether the iterator is currently entering or leaving the node. 
+The above [example](#example-for-wrapping-a-libxml2-tree) for iterating through an XML tree illustrates this.
+
 On the other hand, the `CxTreeVisitor` performs a breadth-first iteration and visits every node only once.
 
 Since tree iteration needs to keep track of a stack (depth-first) or queue (breadth-frist), internal memory is allocated.
 This memory is _automatically_ disposed when the iteration _completes_.
 If you break from the iteration early, you must call `cxTreeIteratorDispose()` or `cxTreeVisitorDispose()`, respectively, to deallocate the memory.
 
-> It is strongly recommended to always invoke the dispose functions, even when it seems not necessary.
-> In the best case it just does nothing, but calling them guarantees that no memory can be leaking.
+> It is recommended to always invoke the dispose functions, even when it seems not necessary.
+> In the best case it just does nothing, but calling them guarantees that no memory can be leaking, even when your code changes in the future.
 >{style="note"}
 
+The macros `cxTreeIteratorContinue()` and `cxTreeVisitorContinue()` equivalently instruct the iterator/visitor to skip the subtree below the currently inspected node.
 
 ## Remove