Source Code for HappyCoders.eu article series on tree data structures (binary tree, binary search tree, AVL tree, red-black tree).

After the function calls have been expanded, the AST is traversed depth-first to gather enriched information about the document, such as: For clear performance reasons, only one traversal is performed ...