Balanced Binary Search Tree Features Implemented:
- Create a Balanced Binary Search Tree
- Insert a Node
- Print Tree a. Preorder Traversal Sequence b. Inorder Traversal Sequence c. Postorder Traversal Sequence
- Total No of Nodes
- Total No of Internal Nodes
- Total No of External Nodes
- Preorder Traversal Sequence
- Inorder Traversal Sequence
- Postorder Traversal Sequence
- Quit
AVL Rotations Implemented.
To run on command prompt:
gcc B_BST.c
gcc -o B_BST B_BST.c
B_BST.exe