Tree Traverse || Inorder, Preorder and Postorder in C

Tree traverse full source code.
There are six methods I've just given in this tree traverse problems ->

1. Create a tree                                            (line no : 10-29)
2. Display tree as inorder format                    (line no : 32-38)
3. Display tree as preorder format                  (line no : 39-45)
4. Display tree as postorder format                 (line no : 48-54)
5. Find the maximum value of a tree               (line no : 67-74)
6. Find the minimum value of a tree                (line no : 58-65)

---

#include<stdio.h>
#include<stdlib.h>


typedef struct BSTnode{
 int data;
 struct BSTnode *left;
 struct BSTnode *right;
};


struct BSTnode *insert(struct BSTnode *root, int value){
 if(root == NULL){
  root = (struct BSTnode*)malloc(sizeof(struct BSTnode));
  root->left = root->right = NULL;
  root->data = value;
  return root;
 }else{
  if(value < root->data){
   root->left = insert(root->left, value);
  }else{
   if(value > root->data){
    root->right = insert(root->right, value);
   }else{
    
   }
  }
  return root;
 }
 
};


//making display inorder
void inorder(struct BSTnode *root){
 if(root != NULL){
  inorder(root->left);
  printf("%d\t", root->data);
  inorder(root->right);
 }
}
//making display preorder
void preorder(struct BSTnode *root){
 if(root != NULL){
  printf("%d\t", root->data);
  preorder(root->left);
  preorder(root->right);
 }
}
//making display postorder
void postorder(struct BSTnode *root){
 if(root != NULL){
  postorder(root->left);
  postorder(root->right);
  printf("%d\t", root->data);
 }
}






int minValue(struct BSTnode* node) {
 struct BSTnode* current = node;
 
 while (current->left != NULL) {
  current = current->left;
 }
 return(current->data);
}


int maxValue(struct BSTnode* node) {
 struct BSTnode* current = node;
 
 while (current->right != NULL) {
  current = current->right;
 }
 return(current->data);
}






int main(){
 
 struct BSTnode *root  = NULL;
// root = (struct BSTnode*)malloc(sizeof(struct BSTnode));
 
 int n,i,x;
 printf("Enter the number of nodes : ");
 scanf("%d", &n);
 
 
 for(i = 1; i <=n; i++){
  printf("Enter the root : ");
  scanf("%d", &x);
  root = insert(root, x);
 }
 printf("After inorder tree is : \n");
 inorder(root);
 
 printf("\n----------------------------------\n");
 
 printf("After preorder tree is : \n");
 preorder(root);
 printf("\n----------------------------------\n");
 
 printf("After postorder tree is : \n");
 postorder(root);
 printf("\n----------------------------------\n");
 
 printf("%d", maxValue(root));
 
 printf("\n----------------------------------\n");
 
 printf("%d", minValue(root));
 
 
 
 printf("\n----------------------------------\n");
}







Store in Github TO see click the link:

Go to Github








I've described full tree traverse so much easily here. You can try it now..And if you face any problem to solve this inform me or comment here.