https://github.com/lsafonso/binary-search-tree
A binary search tree is a tree data structure in which each node has at most two children, referred to as the left and right child. For each node, all elements in the left subtree are less than the node's value, and all elements in the right subtree are greater.
https://github.com/lsafonso/binary-search-tree
algorithms algorithms-and-data-structures binary-search binary-search-tree java
Last synced: 7 months ago
JSON representation
A binary search tree is a tree data structure in which each node has at most two children, referred to as the left and right child. For each node, all elements in the left subtree are less than the node's value, and all elements in the right subtree are greater.
- Host: GitHub
- URL: https://github.com/lsafonso/binary-search-tree
- Owner: lsafonso
- Created: 2024-01-02T12:22:38.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-01-02T12:27:26.000Z (almost 2 years ago)
- Last Synced: 2025-02-18T02:14:19.801Z (10 months ago)
- Topics: algorithms, algorithms-and-data-structures, binary-search, binary-search-tree, java
- Language: Java
- Homepage:
- Size: 4.88 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# binary-search-tree
A binary search tree is a tree data structure in which each node has at most two children, referred to as the left and right child.
For each node, all elements in the left subtree are less than the node's value, and all elements in the right subtree are greater.
