https://github.com/fix2015/structure_bst
A **Binary Search Tree (BST)** is a tree data structure where each node has at most two children, referred to as the left and right children. The left child’s value is less than the parent node’s value, and the right child’s value is greater than the parent node’s value.
https://github.com/fix2015/structure_bst
Last synced: 2 months ago
JSON representation
A **Binary Search Tree (BST)** is a tree data structure where each node has at most two children, referred to as the left and right children. The left child’s value is less than the parent node’s value, and the right child’s value is greater than the parent node’s value.
- Host: GitHub
- URL: https://github.com/fix2015/structure_bst
- Owner: fix2015
- Created: 2025-01-18T13:56:50.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2025-01-18T14:00:50.000Z (12 months ago)
- Last Synced: 2025-01-18T15:07:49.833Z (12 months ago)
- Language: JavaScript
- Size: 8.79 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0