上代码(创建树,先序,中序,后序)

#include<bits/stdc++.h>
using namespace std;
typedef struct TreeNode *BinTree;
struct TreeNode
{BinTree left,right;int value;
};
BinTree CreateTree()
{BinTree T;int value;cin>>value;if(value==0)        //如果输入0,则创建树停止{T=NULL;}else{T=(BinTree)malloc(sizeof(TreeNode));T->value=value;T->left=CreateTree();T->right=CreateTree();}return T;
}
void Preorder(BinTree T)//Preorder Traversal,root first,left-child second,right-child third.
{if(T==NULL){return;}cout<<T->value<<endl;Preorder(T->left);Preorder(T->right);return;
}
void Inorder(BinTree T)//Inorder Traversa,left-child first,root second,right-child third.
{if(T==NULL){return;}Inorder(T->left);cout<<T->value<<endl;Inorder(T->right);return ;
}
void Postorder(BinTree T)//Postorder Traversal,left-child first,right-child second,root third.
{if(T==NULL){return ;}Postorder(T->left);Postorder(T->right);cout<<T->value<<endl;return ;
}
int main()
{BinTree root;root=CreateTree();Preorder(root);Inorder(root);Postorder(root);return 0;
}

代码暂不做解释,留个人参考使用.
 
 
测试数据:
input:
1 2 4 0 0 5 0 0 3 0 0

output:
1 2 4 5 3
4 2 5 1 3
4 5 2 3 1
(将换行更改一下)