二叉树的遍历、深度、结点个数

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stack>
#include <deque>
using namespace std;

//二叉树节点的描述
typedef struct BiTNode
{
    char data;
    struct BiTNode *lchild, *rchild;
}BiTNode, *BiTree;

//按照先序遍历创建二叉树
void CreateBiTree(BiTNode **root)
{
    char ch;//要插入的数据
    scanf("\n%c", &ch);
    //cin>>ch;
    if (ch == '#')
        *root = NULL;
    else
    {
        *root = (BiTNode*)malloc(sizeof(BiTNode));
        (*root)->data = ch;
        printf("请输入%c的左孩子:", ch);
        CreateBiTree(&((*root)->lchild));
        printf("请输入%c的右孩子:", ch);
        CreateBiTree(&((*root)->rchild));
    }
}

//前序递归遍历
void PreOrder(BiTNode *root)
{
    if (root == NULL)
        return;
    printf("%c", root->data); //输出数据
    PreOrder(root->lchild); //递归调用，前序遍历左子树
    PreOrder(root->rchild); //递归调用，前序遍历右子树
}

//中序递归遍历
void InOrder(BiTNode *root)
{
    if (root == NULL)
        return;
    InOrder(root->lchild);
    printf("%c", root->data);
    InOrder(root->rchild);
}

//后序递归遍历
void PostOrder(BiTNode *root)
{
    if (root == NULL)
        return;
    PostOrder(root->lchild);
    PostOrder(root->rchild);
    printf("%c", root->data);
}

//非递归前序遍历
void PreOrderUnRecur(BiTree root)
{
    if (root == NULL)
        return;
    stack<BiTree>s;
    s.push(root);
　　
    while (!s.empty())
    {
        BiTree temp = s.top();
        cout << temp->data << "";
        s.pop();
        if (temp->rchild)
            s.push(temp->rchild);
        if (temp->lchild)
            s.push(temp->lchild);
    }
}

//非递归中序遍历
void InOrderUnRecur(BiTree root)
{
    if (root == NULL)
        return;
    stack<BiTree>s;
    BiTree curr = root;
    while (curr != NULL || !s.empty())
    {
        while (curr != NULL)
        {
            s.push(curr);
            curr = curr->lchild;
        }
        if (!s.empty())
        {
            curr = s.top();
            s.pop();
            cout << curr->data << " ";
            curr = curr->rchild;
        }
    }
}

//非递归后序
void PostOrderUnRecur(BiTree root)
{
    if (root == NULL)
        return;
    stack<BiTree>s1, s2;
    BiTree curr;
    s1.push(root);
    while (!s1.empty())
    {
        curr = s1.top();
        s1.pop();
        s2.push(curr);
        if (curr->lchild)
            s1.push(curr->lchild);
        if (curr->rchild)
            s1.push(curr->rchild);
    }
    while (!s2.empty())
    {
        cout << s2.top()->data << " ";
        s2.pop();
    }

}

//递归层次遍历二叉树
void PrintFromTopToButtom(BiTree root)
{
    if(!root)
        return;
    deque<BiTree>d;
　　　　 d.push_back(root);
    while(d.size())
    {
        BiTree curr = d.front();
        d.pop_front();
        cout << curr->data << " ";
        if (curr->lchild)
           d.push_back(curr->lchild);
        if (curr->rchild)
            pushback(curr->rchild);
    }
}

//递归求树的深度
int FindTreeDeep(BiTree root)
{
    int deep = 0;
    if (root)
    {
        int lchilddeep = FindTreeDeep(root->lchild);
        int rchilddeep = FindTreeDeep(root->rchild);
        deep = (lchilddeep >= rchilddeep ? lchilddeep : rchilddeep)+1;
    }
    return deep;
}

//树的节点个数
int CountNode(BiTree root)
{
    if (root == NULL)
        return  0;
    return (CountNode(root->lchild) + CountNode(root->rchild)) + 1;
}
int main(void)
{
    BiTNode *root = NULL;
    int flag = 1;
    int k;
    printf("本程序实现二叉树的基本操作\n");

    while (flag)
    {
        printf("|--------------------------------------------------|\n");
        printf("|                二叉树基本操作                    |\n");
        printf("|                0.创建二叉树                      |\n");
        printf("|                1.递归前序遍历                    |\n");
        printf("|                2.递归中序遍历                    |\n");
        printf("|                3.递归后序遍历                    |\n");
        printf("|                4.非递归前序遍历                  |\n");
        printf("|                5.非递归中序遍历                  |\n");
        printf("|                6.非递归后序遍历                  |\n");
        printf("|                7.层次递归遍历                    |\n");
        printf("|                8.二叉树深度                      |\n");
        printf("|--------------------------------------------------|\n");

        printf("选择功能：\n");

        scanf("%d", &k);
        switch (k)
        {
        case 0:
            printf("建立二叉树并输入二叉树的根节点：\n");
            CreateBiTree(&root);
            break;
        case 1:
            if (root)
            {
                printf("递归前序遍历二叉树：\n");
                PreOrder(root);
                printf("\n");
            }
            else
                printf("二叉树为空：\n");
            break;
        case 2:
            if (root)
            {
                printf("递归中序遍历二叉树：\n");
                InOrder(root);
                printf("\n");
            }
            else
                printf("二叉树为空：\n");
            break;
        case 3:
            if (root)
            {
                printf("递归后序遍历二叉树：\n");
                PreOrder(root);
                printf("\n");
            }
            else
                printf("二叉树为空：\n");
            break;
        case 4:
            if (root)
            {
                printf("递归前序遍历二叉树：\n");
                PreOrderUnRecur(root);
                printf("\n");
            }
            else
                printf("二叉树为空：\n");
            break;
        case 5:
            if (root)
            {
                printf("递归中序遍历二叉树：\n");
                InOrderUnRecur(root);
                printf("\n");
            }
            else
                printf("二叉树为空：\n");
            break;
        case 6:
            if (root)
            {
                printf("递归后序遍历二叉树：\n");
                PreOrderUnRecur(root);
                printf("\n");
            }
            else
                printf("二叉树为空：\n");
            break;
        case 7:
            if (root)
            {
                printf("层次递归遍历二叉树：\n");
                PrintFromTopToButtom(root);
                printf("\n");
            }
            else
                printf("二叉树为空：\n");
            break;
        case 8:
            if (root)
                printf("二叉树深度：%d\n",FindTreeDeep(root));
            else
                printf("二叉树为空：\n");
            break;
        case 9:
            if (root)
                printf("二叉树节点个数：%d\n",CountNode(root));
            else
                printf("二叉树为空：\n");
            break;
        default:
            flag = 0;
            printf("程序结束\n");

        }
    }
    system("pause");
    return 0;
}