π An immersive way to explore and understand Binary Trees, BST, AVL, Red-Black Trees, Heaps, and Tries through interactive animations.
Binary Tree Visualizer is an interactive learning platform built with React + Vite.
It helps students and developers visualize tree-based data structures dynamically β making complex DSA topics easy to grasp.
π§ It blends learning with visual engagement using 3D particles, smooth transitions, and Lottie animations.
| Tree Type | Description |
|---|---|
| π³ Binary Tree | Basic parent-child relationships |
| πΏ Binary Search Tree (BST) | Ordered hierarchical tree |
| π² AVL Tree | Self-balancing BST |
| π΄ Red-Black Tree | Balanced search tree with color properties |
| π§± Heap | Min/Max heap operations |
| π Trie | String-based data structure |
| Layer | Tools |
|---|---|
| π» Frontend | React + Vite |
| π¨ Styling | CSS + Framer Motion + Custom Animations |
| π§© Visualization | Lottie JSON + Particle.js |
| π¦ Package Manager | npm |
| π§ Config | vite.config.js |
BinaryTree_Visualizer/
βββ public/
β βββ animations/ # Lottie animations (BST, AVL, Heap, etc.)
βββ src/
β βββ components/ # Core visual and logic components
β βββ data/ # Quiz and algorithm data
β βββ assets/ # Icons, SVGs
β βββ styles.css # Global styles
β βββ App.jsx # Root component
βββ index.html
βββ vite.config.js
βββ package.json
βββ README.mdgit clone https://github.com/Orb-20/BinaryTree_Visualizer.gitnpm installnpm run devπ Usually at β http://localhost:5173
- π₯ Real-time Tree Animations
- π³ Visual operations: Insert, Delete, Traverse
- π§© Quiz Section for Learning Reinforcement
- π‘ Modern UI with smooth transitions
- π Extendable codebase (add your own data structures easily!)
- π Add Segment Tree and Fenwick Tree
- π§ AI-powered learning hints
- π¨ Light/Dark Theme Toggle
- π± Responsive mobile support
π§βπ» Orb-20
Built with passion for open-source & computer science learning β€οΈ