https://github.com/0xabdulkhaliq/binary-search-trees
An interactive demonstration of Binary Search Tree operations.
https://github.com/0xabdulkhaliq/binary-search-trees
algorithms binary-search-tree css es6 html javascript webpack
Last synced: 5 months ago
JSON representation
An interactive demonstration of Binary Search Tree operations.
- Host: GitHub
- URL: https://github.com/0xabdulkhaliq/binary-search-trees
- Owner: 0xabdulkhaliq
- License: mit
- Created: 2023-10-13T13:59:11.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-08-23T05:28:50.000Z (almost 2 years ago)
- Last Synced: 2025-07-08T07:03:57.486Z (12 months ago)
- Topics: algorithms, binary-search-tree, css, es6, html, javascript, webpack
- Language: JavaScript
- Homepage: https://binary-search-trees.vercel.app
- Size: 318 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
**❝** Experience binary search trees in action with interactive demonstrations **❞**
❯
View Demo
·
Report Bug
·
Request Feature
❮
## Installation
> [!NOTE]
> If you prefer not to install it locally, you can also access the [live demo](https://binary-search-trees.vercel.app/) version
To set up the BST Application locally, follow these steps:
1. Clone the GitHub repository to your local machine:
```bash
git clone https://github.com/0xabdulkhaliq/binary-search-trees.git
```
2. Navigate to the project's directory:
```bash
cd binary-search-trees
```
3. Install the project's dependencies using npm:
```bash
npm install
```
4. Build the project to bundle JavaScript, minify HTML and CSS, and move images:
```bash
npm run build
```
5. The build files can be found on `dist` (distribution) directory.
## Features
- **Create and Visualize BST**: Easily create a binary search tree from an array and visualize its structure.
- **Interactive Operations**: Insert, delete, and search for values within the tree, providing insights into how BSTs work.
- **Measure Tree Height**: Calculate the height of the tree, an essential metric in tree analysis.
- **Determine Depth**: Find the depth of a specific value in the tree to understand its position.
- **Check for Balance**: Evaluate tree balance to optimize performance.
- **Tree Traversals**: Explore different tree traversal algorithms, including level-order, pre-order, in-order, and post-order.
- **Seamless Theme Switching**: Enjoy a light or dark theme at your convenience, and your preferred theme is automatically saved in local storage for a consistent experience across visits.
- **Optimized for Any Screen**: Effortlessly adapt to screens of all sizes, ensuring a flawless experience on both desktop and mobile devices.
- **ES6 Modules**: JavaScript code is organized into ES6 modules for improved maintainability.
- **Webpack Bundling**: Optimize resource loading by bundling JavaScript modules with Webpack.
- **Cross-Browser Compatibility**: Ensure smooth performance across various web browsers.
- **Code Formatting Guidelines**: The project adheres to coding standards and maintains code consistency by implementing ESLint along with Prettier for code formatting.
## Pagespeed Insights Score
- ||
| :-----: |
| Overall Score 98.5%, Average of Mobile and Desktop
[ Mobile devices score is only shown below ] |
| |
| 
|
| |
| Check out [**Pagespeed Insights**](https://pagespeed.web.dev/analysis?url=https%3A%2F%2Fbinary-search-trees.vercel.app%2F) to get live score |
||
## Built With
     
## Tools Used
      
## Let's Connect 👋
