https://github.com/missipsag/binary-search-tree
This is a small project where I learned how to manipulate the Binary Search tree data structure (creating and inserting new nodes, deleting ones, updating key values...) and tree walks algorithms : inorder, preorder, postorder.
https://github.com/missipsag/binary-search-tree
binary-search-tree c data-structures pointer
Last synced: 7 months ago
JSON representation
This is a small project where I learned how to manipulate the Binary Search tree data structure (creating and inserting new nodes, deleting ones, updating key values...) and tree walks algorithms : inorder, preorder, postorder.
- Host: GitHub
- URL: https://github.com/missipsag/binary-search-tree
- Owner: missipsag
- Created: 2024-06-18T09:26:40.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-10-21T09:03:58.000Z (about 1 year ago)
- Last Synced: 2025-02-03T09:54:52.261Z (9 months ago)
- Topics: binary-search-tree, c, data-structures, pointer
- Language: C
- Homepage:
- Size: 112 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Binary Search tree overview
***
A **Binary Search Tree** is a data structure used in computer science for organizing and storing data in a sorted manner. Each node in a Binary Search Tree **has at most two children**, a left child and a right child, with the left child containing values less than the parent node and the right child containing values greater than the parent node. This hierarchical structure allows for efficient **searching**, **insertion**, and **deletion** operations on the data stored in the tree.
