example is linked in the readme

Author: orxfun

README.md

@@ -375,6 +375,10 @@ let remaining_bfs: Vec<_> = tree.root().walk::<Bfs>().copied().collect();
 assert_eq!(remaining_bfs, [1, 3, 6, 9]);
 ```
 
+### More Examples
+
+* [mutable_recursive_traversal](https://github.com/orxfun/orx-tree/blob/main/examples/mutable_recursive_traversal.rs) demonstrates different approaches to achieve a recursive mutation of all nodes in the tree.
+
 ## Contributing
 
 Contributions are welcome! If you notice an error, have a question or think something could be added or improved, please open an [issue](https://github.com/orxfun/orx-tree/issues/new) or create a PR.

examples/mutable_recursive_traversal.rs

@@ -1,5 +1,7 @@
 // # EXAMPLE DEFINITION
 //
+// cargo run --example mutable_recursive_traversal
+//
 // This example demonstrates a use case where value of a node is defined
 // as a function of the values of its children. Since the value of a child
 // of the node also depends on values of its own children, it follows that