二叉树的创建与三种递归遍历

#include<iostream>
struct tree
{
struct tree *left;
struct tree *right;
int data;
};
tree *T;
typedef struct tree *Tree,*TNode,TREE;
using namespace std;
void PreCreateTree(Tree& T);
void PreOrder(Tree& T);
void InOrder(Tree& T);
void PostOrder(Tree& T);
int main()
{
cout<<"输入现需创建二叉树的序列："<<endl;
PreCreateTree(T);
cout<<"前序遍历结果为:";
PreOrder(T);


return 0;
cout<<endl;
cout<<"中序遍历结果为:";
InOrder(T);
cout<<endl;
cout<<"后序遍历结果为:";
PostOrder(T);
return 0;
}

void PreCreateTree(Tree& T)
{
int data;
cin >> data;
T = new tree;
if (data == -1)
{
T = NULL;
return;
}
T->left = NULL;
T->right = NULL;
T->data = data;
PreCreateTree(T->left);
PreCreateTree(T->right);
}
void PreOrder(Tree& T)
{
if(T==NULL)
return;
if (T)
{
cout << T->data;
PreOrder(T->left);
PreOrder(T->right);
}
}
void InOrder(Tree& T)
{
if (T)
{
InOrder(T->left);
cout << T->data ;
InOrder(T->right);
}else{
return;
}
}
void PostOrder(Tree& T)
{
if (T)
{
PostOrder(T->left);
PostOrder(T->right);
cout << T->data ;
}else{
return;
}
}

二叉树的创建与三种递归遍历

原文：https://www.cnblogs.com/lglbk/p/10794252.html