Operations on Binary-Search-Tree
By Asim Krishna Prasad
Posted on 23/11/14
Tag :
Data Structures
Binary-Search-Tree is one basic but very important data-structure.. In this post I have implemented different operations on BST in C..
The operations implemented here include :
> Insertion of nodes
> Pre-order Traversal
> In-order Traversal
> Post-order Traversal
> Level-order Traversal
> Deletion of nodes
And here is the code in C
Hope it helps :)
Asim Krishna Prasad
COMMENTS :