Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/gauranshgoel123/binary-tree-search-visualization

Binary Search Tree Visualization is a web application that allows users to input numbers and visualize the resulting Binary Search Tree (BST). The tree is dynamically displayed in a hierarchical format, providing an interactive and clear representation of the BST structure.
https://github.com/gauranshgoel123/binary-tree-search-visualization

bst-tree css datastructures html javascript tree-structure

Last synced: about 2 months ago
JSON representation

Binary Search Tree Visualization is a web application that allows users to input numbers and visualize the resulting Binary Search Tree (BST). The tree is dynamically displayed in a hierarchical format, providing an interactive and clear representation of the BST structure.

Awesome Lists containing this project

README

        

# Binary Search Tree Visualization

This project is a simple web application that allows users to visualize a Binary Search Tree (BST). Users can input a list of numbers, and the application will build and display the BST in a hierarchical tree structure.

## Table of Contents
- [Features](#features)
- [Technologies](#technologies)
- [Setup](#setup)
- [Usage](#usage)
- [Contributing](#contributing)
- [License](#license)

## Features
- Input numbers to build a Binary Search Tree.
- Visualize the tree structure dynamically.
- Interactive UI with node hover effects.
- Clear and concise user interface.

## Technologies
- HTML
- CSS
- JavaScript

## Setup
1. Clone the repository:
```bash
git clone https://github.com/yourusername/bst-visualization.git
```
2. Navigate to the project directory:
```bash
cd bst-visualization
```
3. Open the `index.html` file in your web browser to view the application.

## Usage
1. Enter numbers in the input field, separated by commas (e.g., `5, 3, 7, 2, 4, 6, 8`).
2. Click the "Build Tree" button to generate the Binary Search Tree.
3. The tree will be displayed below the input field in a hierarchical structure.

## Contributing
Contributions are welcome! If you have suggestions or improvements, feel free to create an issue or submit a pull request. Please follow the standard GitHub workflow for contributions:
1. Fork the repository.
2. Create a new branch (`git checkout -b feature-branch`).
3. Make your changes and commit them (`git commit -m 'Add some feature'`).
4. Push to the branch (`git push origin feature-branch`).
5. Create a new Pull Request.

## License
This project is licensed under the MIT License.