How moyarzunsil/eda-btree works
This repository is a teaching workshop about auditing a B-Tree implementation; its runnable product is an in-memory B-Tree and a small demonstration. The documented workflow is to run the demo, which builds a tree, exercises its operations and prints results. The tree delegates key-position lookup to nodes and tracks operation counters through metrics. The excerpts show these runtime calls, but not a separate audit application or persistent storage; tests and assignment deliverables are omitted from the runtime map.
Main entry points: tree.py B-Tree · main.py Demo entry · node.py Tree node · metrics.py Operation metrics
Components 6
B-Tree runtime
- B-Tree
src/btree/tree.py - Tree node
src/btree/node.py - Operation metrics
src/btree/metrics.py
Demonstration
- Demo entry
src/main.py
Other components
- Demo runner
- Console output
Connections 6
- Demo runner → Demo entry: runs demo
README.md - Demo entry → B-Tree: builds and exercises
src/main.py - B-Tree → Tree node: creates and searches
src/btree/tree.py - B-Tree → Operation metrics: updates counters
src/btree/tree.py - Tree node → Operation metrics: counts comparisons
src/btree/node.py - Demo entry → Console output: prints results
src/main.py