How rzhyv/binary-trees works
This is a single-file C++ expression-tree exercise. Its apparent user workflow is to read an expression, build a tree, display traversals, and evaluate it. The excerpt contains compile-time and logic inconsistencies, so the graph reflects the intended responsibilities visible in the code, not a confirmed working execution; there is no README or evidence of other product capabilities.
Main entry points: pptCodes.cpp Program Entry
Components 8
Expression Trees
- Program Entry
pptCodes.cpp - Tree Builder
pptCodes.cpp - Tree Evaluator
pptCodes.cpp - Tree Display
pptCodes.cpp
Tree Structures
- Expression Tree
pptCodes.cpp - Operator Stack
pptCodes.cpp - Node Stack
pptCodes.cpp
Other components
- User
Connections 9
- User → Program Entry: enters expression
pptCodes.cpp - Program Entry → Tree Builder: builds tree
pptCodes.cpp - Tree Builder → Operator Stack: uses operators
pptCodes.cpp - Tree Builder → Node Stack: assembles nodes
pptCodes.cpp - Tree Builder → Expression Tree: creates tree
pptCodes.cpp - Program Entry → Tree Display: displays traversals
pptCodes.cpp - Program Entry → Tree Evaluator: evaluates tree
pptCodes.cpp - Tree Evaluator → Expression Tree: reads nodes
pptCodes.cpp - Tree Display → Expression Tree: visits nodes
pptCodes.cpp