https://github.com/gotz1480/binary-search-tree
BST (binary search tree) implementation in Go
https://github.com/gotz1480/binary-search-tree
Last synced: 6 months ago
JSON representation
BST (binary search tree) implementation in Go
- Host: GitHub
- URL: https://github.com/gotz1480/binary-search-tree
- Owner: gotz1480
- License: mit
- Created: 2024-02-15T07:28:37.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-02-19T04:10:17.000Z (over 1 year ago)
- Last Synced: 2025-04-04T13:13:18.795Z (6 months ago)
- Language: Go
- Size: 3.91 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# BST (binary search tree) implementation in Go
This repository contains a simple user management system implemented using a Binary Search Tree (BST) in Go. It showcases how BSTs can be utilized for efficient data storage and retrieval, focusing on managing user information by unique IDs.
## Introduction
The project demonstrates a basic implementation of a Binary Search Tree to manage user data. Each user is identified by a unique ID and has associated information, such as a name. The BST allows for efficient insertion and search operations based on the user ID.
## Features
- Insertion of new user records into the BST.
- Searching for users by their unique ID.
- Simple and efficient data structure for user management.
## Getting Started
### Prerequisites
- Go (Golang) installed on your machine. Visit [Go's official website](https://golang.org/dl/) for download and installation instructions.
### Running the Code
1. Clone the repository to your local machine.
2. Navigate to the directory containing the code.
3. Run the program using the Go command:
```sh
go run main.go
```
This will execute the main program, which includes inserting several users into the BST and searching for specific users by ID.
## Example Output
```
User found: &{ID:50 Name:Jane Smith}
User not found
```
## Contributing
Contributions are welcome! If you have suggestions for improving this project, please feel free to fork the repository and submit a pull request.
## License
This project is open source and available under the [MIT License](LICENSE).