BST(Binary Search Tree) program in C #135

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Open

nsree0507 wants to merge 1 commit into harsh2102:master from nsree0507:bst-program

nsree0507 commented Nov 7, 2025

Binary Search Tree (BST) program in C with the following features:

Insertion: Add nodes to the BST dynamically.
Traversals: Preorder, Inorder, and Postorder.
Search: Find a value in the BST.
Deletion: Remove a node while maintaining BST properties.
Node counts: Count total nodes, leaf nodes, and parent nodes.
Height: Calculate the height of the BST.
Balance check at root: Checks balance in terms of nodes and height at root.
Minimum and Maximum: Find the smallest and largest value in the BST.
Memory cleanup: Frees allocated memory on exit.


          BST(Binary Search Tree) program in C

4d7ca35

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet