#include <iostream>
using namespace std;
//二叉树,统一节点
//学二叉树的目的是查找
//二叉树统一节点结构的原因:例如:左子树代表下级,右子树代表下级
//所谓的先中后是:访问根节点的时机
//先序遍历即:根左右
//中序遍历即:左根右
//后序遍历即:左右根
//只两者可求第三者,必须有中序遍历
//已知先序中序,求后序:先序遍历第一个即为根,根据先序遍历找根,根据中序遍历找左右子树(只在第一步有用)
//已知中序后续求先序:后序遍历的最后一个即为根,从后往前看;根据中序遍历找左右子树(只在第一步有用)
typedef struct _TreeNode
{
int data;
struct _TreeNode* left;
struct _TreeNode* right;
}TreeNode;
void preOrderTraverse(TreeNode* r)
{
if(r)
{
printf("%d ",r->data);
preOrderTraverse(r->left);
preOrderTraverse(r->right);
}
}
void midOrderTraverse(TreeNode* r)
{
if(r)
{
midOrderTraverse(r->left);
printf("%d ",r->data);
midOrderTraverse(r->right);
}
}
void postOrderTraverse(TreeNode* r)
{
if(r)
{
postOrderTraverse(r->left);
postOrderTraverse(r->right);
printf("%d ",r->data);
}
}
int main()
{
TreeNode a,b,c,d,e,f;
a.data = 1;
b.data = 2;
c.data = 3;
d.data = 4;
e.data = 5;
f.data = 6;
a.left = &b;
a.right = &c;
b.left = &d;
b.right = &e;
c.left = NULL;
c.right = &f;
d.left = d.right = e.left =e.right = f.left =f.right = NULL;
preOrderTraverse(&a);
printf("\n");
midOrderTraverse(&a);
printf("\n");
postOrderTraverse(&a);
cout << "Hello World!" << endl;
return 0;
}
运行结果: