https://github.com/shahzaibdev355/binary-search-tree
A binary search tree (BST) is a node-based binary tree data structure that follows a strict order, where the nodes with keys greater than any particular node A are stored on the right sub-trees to that node A, and the nodes with keys equal to or less than A are stored on the left sub-trees to A,
https://github.com/shahzaibdev355/binary-search-tree
Last synced: about 1 month ago
JSON representation
A binary search tree (BST) is a node-based binary tree data structure that follows a strict order, where the nodes with keys greater than any particular node A are stored on the right sub-trees to that node A, and the nodes with keys equal to or less than A are stored on the left sub-trees to A,
- Host: GitHub
- URL: https://github.com/shahzaibdev355/binary-search-tree
- Owner: Shahzaibdev355
- Created: 2023-08-21T18:43:44.000Z (almost 3 years ago)
- Default Branch: master
- Last Pushed: 2023-08-21T18:46:15.000Z (almost 3 years ago)
- Last Synced: 2025-02-22T04:44:21.854Z (over 1 year ago)
- Language: Python
- Homepage:
- Size: 0 Bytes
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files: