How bugbl3wed/expression-tree-visualizer works
This small C++ demo builds an expression tree from a hard-coded infix expression, prints preorder and postorder traversals, evaluates the tree, and renders it sideways with node values. Evaluation treats each leaf as 1 rather than reading numeric operands. All behavior is in the single sampled source file.
Main entry points: expression_tree.cpp Program entry
Components 7
Other components
- Program entry
expression_tree.cpp - Tree builder
expression_tree.cpp - Expression tree
expression_tree.cpp - Tree traversals
expression_tree.cpp - Tree evaluator
expression_tree.cpp - Rotated renderer
expression_tree.cpp - Standard output
Connections 9
- Program entry → Tree builder: builds via
- Tree builder → Expression tree: creates nodes
- Program entry → Tree traversals: runs traversals
- Tree traversals → Standard output: prints values
- Program entry → Tree evaluator: evaluates tree
- Tree evaluator → Tree evaluator: recurses over
- Program entry → Rotated renderer: renders tree
- Rotated renderer → Tree evaluator: evaluates nodes
- Rotated renderer → Standard output: prints layout