二叉树的基本操作

1.在刚开始界面，会提示用户输入要构建二叉树的值（以#为空）

 

 

2.接下来会进行打印二叉树的层数

  前序遍历

  后序遍历

  中序遍历

  层序遍历

  二叉树的图形化

 

 

3.源码如下所示：

#include <iostream>
#include<math.h>
#include<queue>
using namespace std;
void menu();
string tree[100][100];
template <typename t>
struct BiNode
{
    t data;
    BiNode* leftChild;
    BiNode* rightChild;
};
template <typename t>
class BiTree
{
public:
    BiTree() { createTree(root); }
    ~BiTree() { destroyTree(root); }
    void preOrder();
    void inOrder();
    void postOrder();
    void levelOrder();
    void print(int x, int y, int layers);
    int treelayer();
private:
    BiNode<t>* root;
protected:
    void print(BiNode<t>* node, int x, int y, int layers);
    void createTree(BiNode<t>*& node);
    void destroyTree(BiNode<t>* node);
    void preOrder(BiNode<t>* node);
    void inOrder(BiNode<t>* node);
    void postOrder(BiNode<t>* node);
    int treelayer(BiNode<t>* node);
};
template <typename t>
void BiTree<t>::createTree(BiNode<t>*& node)
{
    string item;
    cin >> item;
    if (item == "#")
    {
        node = nullptr;
    }
    else
    {
        node = new BiNode<t>;
        createTree(node->leftChild);
        node->data = item;

        createTree(node->rightChild);
    }
}
template <typename t>
void BiTree<t>::destroyTree(BiNode<t>* node)
{
    if (node != nullptr)
    {
        destroyTree(node->leftChild);
        destroyTree(node->rightChild);
        delete node;
    }
}
template <typename t>
void BiTree<t>::preOrder(BiNode<t>* node)
{
    if (node != nullptr)
    {
        cout << node->data << " ";
        preOrder(node->leftChild);
        preOrder(node->rightChild);
    }
}
template <typename t>
void BiTree<t>::inOrder(BiNode<t>* node)
{
    if (node != nullptr)
    {
        inOrder(node->leftChild);
        cout << node->data << " ";
        inOrder(node->rightChild);
    }
}
template <typename t>
void BiTree<t>::postOrder(BiNode<t>* node)
{
    if (node != nullptr)
    {
        postOrder(node->leftChild);
        postOrder(node->rightChild);
        cout << node->data << " ";
    }
}
template <typename t>
void BiTree<t>::levelOrder()
{
    queue< BiNode<t>* >q;
    BiNode<t>* bt = root;
    q.push(root);
    while (!q.empty())
    {
        bt = q.front();
        q.pop();
        cout << bt->data << " ";
        if (bt->leftChild != nullptr)
        {
            q.push(bt->leftChild);
        }
        if (bt->rightChild != nullptr)
        {
            q.push(bt->rightChild);
        }
    }
}
template <typename t>
void BiTree<t>::preOrder()
{
    preOrder(root);
}
template <typename t>
void BiTree<t>::inOrder()
{
    inOrder(root);
}
template <typename t>
void BiTree<t>::postOrder()
{
    postOrder(root);
}
template <typename t>
void BiTree<t>::print(int x, int y, int layers)
{
    print(root, x, y, layers);
}
template <typename t>
int BiTree<t>::treelayer()
{
    int layer;
    layer = treelayer(root);
    return (layer);
}
template <typename t>
int BiTree<t>::treelayer(BiNode<t>* node)
{
    int leftlayer, rightlayer;
    if (node == nullptr)
        return 0; //如果是空树，深度为0，递归结束
    else
    {
        leftlayer = treelayer(node->leftChild);
        rightlayer = treelayer(node->rightChild);
        if (leftlayer > rightlayer)
            return (leftlayer + 1);
        else
            return (rightlayer + 1);
    }
}
void start()
{
    int i, j;
    for (i = 0; i < 100; i++)
    {
        for (j = 0; j < 100; j++)
            tree[i][j] = " ";
    }
}
template <typename t>
void  BiTree<t>::print(BiNode<t>* node, int x, int y, int layers)
{

    int left, right;//左右孩子的x坐标
    layers--;
    int j = pow(2, layers);//孩子坐标偏移量
    if (node != nullptr) {
        left = x - pow(2, layers);
        right = x + pow(2, layers);
        tree[y][x] = node->data;
        if (node->leftChild) {
            for (int i = j; i > 0; i--)
                tree[y + 1][x - i] = "_";
            tree[y + 1][x] = "|";
            tree[y + 2][x - j] = "|";
        }
        if (node->rightChild) {
            for (int i = j; i > 0; i--)
                tree[y + 1][x + i] = "_";
            tree[y + 1][x] = "|";
            tree[y + 2][x + j] = "|";

        }
        y += 3;

        print(node->leftChild, left, y, layers);//左子树
        print(node->rightChild, right, y, layers);//右子树
    }

}
/*
void menu()
{
    cout << "请输入要构造二叉树的值（以#结束）：";
    BiTree<string> b;
    for (;;)
    {
        //system("cls");
        int choice;
        cout << "请选择功能：" << endl;
        cout << "1.前序遍历" << endl;
        cout << "2.后序遍历" << endl;
        cout << "3.中序遍历" << endl;
        cout << "4.层序遍历" << endl;
        cout << "0.退出程序" << endl;
        cin >> choice;
        switch (choice)
        {
        case 1:
            cout << "前序遍历二叉树：";
            b.preOrder();
            cout << endl;
            system("pause");
            break;
        case 2:
            cout << "后序遍历二叉树：";
            b.postOrder();
            cout << endl;
            system("pause");
            break;
        case 3:
            cout << "中序遍历二叉树：";
            b.inOrder();
            cout << endl;
            system("pause");
            break;
        case 4:
            cout << "层序遍历二叉树：";
            b.levelOrder();
            cout << endl;
            system("pause");
            break;
        case 0:
            exit (0);
        default:
            cout << "输入错误，请重新输入";
            system("pause");
            break;
        }
    }
}*/
int main()
{

    int layer;
    cout << "请输入要构造二叉树的值：";
    BiTree<string> b;
    layer = b.treelayer();
    cout << "二叉树的层数为：" << layer << endl;
    cout << "前序遍历二叉树：";
    b.preOrder();
    cout << endl;
    cout << "后序遍历二叉树：";
    b.postOrder();
    cout << endl;
    cout << "中序遍历二叉树：";
    b.inOrder();
    cout << endl;
    cout << "层序遍历二叉树：";
    b.levelOrder();
    cout << endl;
    cout << "打印二叉树：" << endl;
    int death = 3 * (layer - 1) + 1;   
    int x = 0, y = 0;//根节点的坐标	
    x = pow(2, layer);
    start();
    b.print(x, y, layer);
    for (int i = 0; i < death; ++i)
    {
        for (int j = 0; j < 100; ++j)
        {
            cout << tree[i][j];
        }
        cout << endl;
    }
}