二叉树输入 和先序后序中序输出

   #include<stdio.h>
   typedef struct TreeNode{
       int val;
       struct TreeNode *left;
       struct TreeNode *right;
   }node,*treenode;
   int i;
   int CreateTree(treenode *root)
   {
      int val;
      printf("请输入要插入的数");
      scanf("%d",&val);
      if(val<=0)return -1;
      *root = (treenode)malloc(sizeof(node));
      (*root)->val=val;
      CreateTree(&((*root)->left));
      CreateTree(&((*root)->right));
  }   
  void frist_order_traversal(treenode root)
  {
      if(root==NULL)
      {
          return;
      }   
      printf("%d",root->val);
      frist_order_traversal(root->left);
      frist_order_traversal(root->right);
  }  
  void  rear_order_traversal()
  {
      if(root==NULL)
      {
          return;
      }   
      rear_order_traversal(root->left);
      printf("%d",root->val);
      rear_order_traversal(root->right);
  }
  void middle_order_traversal()
  {
	if(root==NULL)
      {
          return;
      }   
      middle_order_traversal(root->left);
      middle_order_traversal(root->right);
		printf("%d",root->val);
}
  int main()
  {
      treenode p;
      CreateTree(&p);
      frist_order_traversal(p);
  }   
~