#include<stdio.h>
#include<stdlib.h>
struct treenode{
    int data;
    struct treenode*left;
    struct treenode*right;
};
struct treenode*createnode(int value){
    struct treenode*new node=(struct treenode*)malloc(sizeof(struct treenode));
    new node->data=data;
    new node->left=NULL;
    new node->right=NULL;
    return new node;
}
struct treenode*insert(struct node*root,int value){
    if(root==NULL){
        return createnode(data);
        
    }
    if(data<root->data){
        root->left=insert(root->left,data);
    }else if(data>root->data){
        root->right=insert(root->right,data);
    }
    return root;
}
void inorder(struct treenode*root){
    if(root==NULL){
        inorder(root->left);
        printf("%d",root->data);
        inorder(root->right);
        
    }
}void preorder(struct treenode*root){
    if(root==NULL){
        printf("%d",root->data);
        preorder(root->left);
        preorder(root->right);
    }
}void postorder(struct treenode*root){
    if(root=NULL){
        postorder(root->left);
        postorder(root->right);
        printf("%d",root->data);
    }
}
int main(){
    struct node*root=NULL;
    int value[]={5,34,88,900,43,280};
    int n=sizeof(values)/sizeof(values[0]);
    for(int i=0;i<n;i++){
        root=insert(root,values[i]);
        
    }
    printf("found");
    inorder(root);
    printf("\n");
    preorder(root);
    printf("\n");
    postorder(root);
    printf("\n");
    
    
    printf("invalid input");
    return 0;
    
}