创建一棵二叉树（C++）以及遍历

来源：https://blog.csdn.net/JXH_123/article/details/36029393

#include<iostream>
using namespace std;
struct Node
{
    int data;
    Node *left;
    Node *right;
    Node(int data)
    {
        this->data=data;
        this->left=NULL;
        this->right=NULL;
    }
};
class BinTree
{
public:
    Node *root;
    Node* CreateTree();
    void preOrder(Node *r);//递归实现先序遍历
    void InOrder(Node *r);//递归实现中序遍历
    void PostOrder(Node *r);//递归实现后续遍历
};

Node* BinTree::CreateTree()//创建一棵二叉树
{
    Node *p1=new Node(1);
    Node *p2=new Node(2);
    Node *p3=new Node(3);
    Node *p4=new Node(4);
    Node *p5=new Node(5);
    Node *p6=new Node(6);
    Node *p7=new Node(7);
    Node *p8=new Node(8);
    Node *p9=new Node(9);
    p1->left=p2;
    p1->right=p3;
    p2->left=p4;
    p2->right=p5;
    p5->left=p6;
    p3->left=p7;
    p3->right=p8;
    p8->right=p9;
    root=p1;
    return p1;
}

void BinTree::preOrder(Node *r)//递归实现先序遍历
{
    if(r==NULL)
    {
        return ;
    }
    else
    {
        cout<<r->data<<" ";
        preOrder(r->left);
        preOrder(r->right);
    }
}

void BinTree::InOrder(Node *r)//递归实现中序遍历
{
    if(r==NULL)
    {
        return ;
    }
    else
    {
        InOrder(r->left);
        cout<<r->data<<" ";
        InOrder(r->right);
    }
}

void BinTree::PostOrder(Node *r)//递归实现后序遍历
{
    if(r==NULL)
    {
        return ;
    }
    else
    {
        PostOrder(r->left);
        PostOrder(r->right);
        cout<<r->data<<" ";
    }
}

int main()
{
    BinTree t;
    t.CreateTree();//创建二叉树
    cout<<"先序遍历:";
    t.preOrder(t.root);//先序遍历
    cout<<endl;

    cout<<"中序遍历:";
    t.InOrder(t.root);//中序遍历
    cout<<endl;

    cout<<"后序遍历:";
    t.PostOrder(t.root);//后序遍历
    cout<<endl;
    return 0;
}