A simple interactive Binary Search Tree (BST) Visualizer built using Python and Tkinter. This application allows users to insert integer values into a BST and see the structure update in real time.
- Input Validation — Prevents invalid or non-numeric input.
- AVL Balance Factor Analyzation — Analyze the balance factors to identify which rotations to use.
- Dynamic Visualization — Watch the BST grow as you insert new nodes.
You can view the full project documentation and code explanation here:
📄 Download AVL VISUALIZER DOCUMENTATION.pdf
📄 Download AVL VISUALIZER FLOWCHART.pdf
-
Clone the repository:
git clone https://github.com/programmerlia/DSA-AVL-Visualizer.git
-
Navigate to the project directory:
cd DSA-AVL-Visualizer
Run the program using Python:
python main.py- Python 3.8+
- Tkinter (included with most Python installations)
You can verify Tkinter installation by running:
python -m tkinter
If a small test window appears, Tkinter is installedThis project is licensed under the MIT License - see the LICENSE file for details.