https://github.com/basemax/traversalbst
This is a simple implementation of Binary Search Tree (BST) in C language. All In-order, Pre-order, and Post-order traversal functions are implemented.
https://github.com/basemax/traversalbst
binary-search-tree binary-tree bst c data-structure datastructure ds inorder postorder postorder-traversal preorder traversal tree
Last synced: about 2 months ago
JSON representation
This is a simple implementation of Binary Search Tree (BST) in C language. All In-order, Pre-order, and Post-order traversal functions are implemented.
- Host: GitHub
- URL: https://github.com/basemax/traversalbst
- Owner: BaseMax
- License: gpl-3.0
- Created: 2022-12-05T05:38:26.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2023-02-03T17:29:57.000Z (over 2 years ago)
- Last Synced: 2025-03-28T17:08:10.129Z (2 months ago)
- Topics: binary-search-tree, binary-tree, bst, c, data-structure, datastructure, ds, inorder, postorder, postorder-traversal, preorder, traversal, tree
- Language: C
- Homepage:
- Size: 89.8 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0