二叉树基本储存和遍历（递归）

 

 

二叉树的顺序储存 

适用于完全二叉树，普通二叉树为了实现基本的访问实现有相当大的空间浪费 

 

下面是更常用的链表储存，以及三种基本遍历的实现：

#include <iostream>
using namespace std;
typedef  struct  TreeNode* BinTree; 
//typedef  BinTree Position; 
struct  TreeNode {
    char  Data;
    BinTree  Left;
    BinTree  Right;
};
/*以前序遍历的形式输入来创建树*/
void CreatBinTree(BinTree &T)
{
    char ch;
    cin >> ch;
    if (ch == '#') T = NULL;
    else {
        T = new struct TreeNode;
        T->Data = ch;
        CreatBinTree(T->Left);
        CreatBinTree(T->Right);
    }
}


bool IsEmpty(BinTree BT)
{
    if (BT) return true;
    else return false;
}

void PreOrderTraversal(BinTree BT)
{
    if (BT)
    {
        cout << BT->Data;
        PreOrderTraversal(BT->Left);
        PreOrderTraversal(BT->Right);
    }
}

void InOrderTraversal(BinTree BT)
{
    if (BT)
    {
        InOrderTraversal(BT->Left);
        cout << BT->Data;
        InOrderTraversal(BT->Right);
    }
}

void PostOrderTraversal(BinTree BT)
{
    if (BT)
    {
        PostOrderTraversal(BT->Left);
        PostOrderTraversal(BT->Right);
        cout << BT->Data;
    }
}
int main()
{
    BinTree t;
    //t = new struct TreeNode;
    CreatBinTree(t);
    PreOrderTraversal(t);
    cout << endl;
    InOrderTraversal(t);
    cout << endl;
    PostOrderTraversal(t);
    
}