Binary Search Tree Project

A simple Binary Search Tree (BST) implementation in JavaScript with a user-friendly web-based UI.

Table of Contents

• Demo
• Features
• Usage
• Contributing
• Acknowledgements

Demo

You can try out the Binary Search Tree UI live at https://3ein39.github.io/odin_BinarySearchTree/

Features

• Create and manipulate Binary Search Trees.
• Insert and delete nodes.
• Perform in-order, pre-order, post-order, and level-order traversals.
• Visualize the tree using a pretty print function.
• User-friendly web-based UI.
• Open-source and easy to customize.

Usage

1. Open the index.html file in your web browser.

2. Use the UI to create and manipulate a Binary Search Tree.

3. Explore the different tree traversal methods and the pretty print function.

Contributing

Contributions are welcome! To contribute to this project, follow these steps:

1. Fork this repository.
2. Create a new branch: git checkout -b feature/your-feature-name
3. Make your changes and commit them: git commit -m 'Add some feature'
4. Push to the branch: git push origin feature/your-feature-name
5. Submit a pull request.

Acknowledgements

• This project was a part of The Odin Project curriculum.
• Special thanks to The Odin Project for providing project ideas and inspiration.