This project is a visual learning tool designed to help students understand binary trees, particularly the different traversal types (preorder, inorder, postorder, and level-order).
I created this tool to provide an easy-to-use visual representation that illustrates how binary trees are structured and how traversals work.
Although not perfect, it effectively serves its educational purpose.
- Help students grasp the concepts behind binary trees.
- Visually demonstrate various tree traversal methods.
- Provide an interactive and easy-to-use interface.
- Serve as a practical educational aid in computer science courses.
| FILE | DESCRIPTION |
|---|---|
assets |
Contains the resources required for the repository. |
index.html |
Main HTML structure for the project. |
script.js |
Behavior script for interactivity. |
README.md |
The README file you are currently reading 😉. |
- Clone this repository:
- Open your preferred Terminal.
- Navigate to the directory where you want to clone the repository.
- Run the following command:
git clone https://github.com/fchavonet/full_stack-binary_tree_visualizer.git
- Open the cloned repository.
-
Open the
index.htmlfile in your web browser. -
Enter comma-separated values in the input field (only the first 15 will be used, and each node label is limited to 2 characters).
-
Click on "Generate Tree" to visualize the binary tree.
-
Use the traversal buttons (Preorder, Inorder, Postorder, Level-order) to see the tree traversal animations.
You can also test the project online by clicking here.
- Add responsive design support.
- Improve the overall user interface and visuals.
- A big thank you to my friends Pierre and Yoann, always available to test and provide feedback on my projects.
Fabien CHAVONET
- GitHub: @fchavonet
