E (1065) : DS二叉树——二叉树之数组存储

---

一、题目描述

二、输入与输出

1.输入

第一行输入一个整数t，表示有t个二叉树

第二行起，每行输入一个数组，先输入数组长度，再输入数组内数据，每个数据之间用空格隔开，输入的数据都是非负整数
连续输入t行

3
3 1 2 3
5 1 2 3 0 4
13 1 2 3 4 0 5 6 7 8 0 0 9 10

---

2.输出

每行输出一个示例的先序遍历结果，每个结点之间用空格隔开

1 2 3 
1 2 4 3 
1 2 4 7 8 3 5 9 10 6 

---

三、参考代码

#include <iostream>
#include <string>
using namespace std;

class TreeNode
{
public:
    char ch;
    TreeNode* lchild;
    TreeNode* rchild;
    TreeNode* parent;
    TreeNode() { lchild = NULL, rchild = NULL; parent = NULL; }
};
class Tree
{
public:
    TreeNode* root;
    string strtree;
    int point;
    int leafnum;
    int lLeafNum;
    int flag1 = 1, flag2 = 1;

    Tree() { leafnum = 0; lLeafNum = 0; };
    ~Tree() {};

    void Create(string s)
    {
        point = 0;
        strtree.assign(s);
        root = CreateTree();
    }


    TreeNode* CreateTree()//递归建树
    {
        TreeNode* n;
        char ch;
        ch = strtree[point];
        point++;

        if (ch == '0')
        {
            n = NULL;
        }
        else
        {
            n = new TreeNode();
            n->ch = ch;
            n->lchild = CreateTree();
            if (n->lchild != NULL)
            {
                n->lchild->parent = n;
            }
            n->rchild = CreateTree();
            if (n->rchild != NULL)
            {
                n->rchild->parent = n;
            }
        }
        return n;
    }
    void Prepri(TreeNode* t)//前序
    {
        if (t)
        {
            cout << t->ch;
            Prepri(t->lchild);
            Prepri(t->rchild);
        }
    }
    void Pospri(TreeNode* t)//后序
    {
        if (t)
        {
            Pospri(t->lchild);
            Pospri(t->rchild);
            cout << t->ch;

        }
    }
    void Inpri(TreeNode* t)//中序
    {
        if (t)
        {
            Inpri(t->lchild);
            cout << t->ch;
            Inpri(t->rchild);
        }
    }
    void LessonNum(TreeNode* t)
    {
        int flag = 1;
        if (t)
        {
            if (t->lchild == NULL && t->rchild == NULL)
            {
                if (flag1)
                {
                    cout << t->ch ;
                    flag1 = 0;
                }
                else
                {
                    cout << " " << t->ch;
                }

            }
            LessonNum(t->lchild);
            LessonNum(t->rchild);
        }
    }
    void LLeafNum(TreeNode* t)
    {
        if (t)
        {
            if (t->lchild == NULL && t->rchild == NULL && t->parent != NULL && t->parent->lchild == t)
            {
                lLeafNum++;
            }
            LLeafNum(t->lchild);
            LLeafNum(t->rchild);
        }
    }
    void LeafAndParent(TreeNode* t)
    {
       
        if (t)
        {
            if (t->lchild == NULL && t->rchild == NULL && t->parent != NULL)
            {
                if (flag2)
                {
                    cout << t->parent->ch;
                    flag2 = 0;
                }
                else
                {
                   
                    cout << " " << t->parent->ch;
                    
                }
            }
            else if(t->lchild == NULL && t->rchild == NULL && t->parent == NULL)
            {
                cout << t->ch << " ";
            }
            LeafAndParent(t->lchild);
            LeafAndParent(t->rchild);
        }
    }
    
};
void pri(int i, int* a, int n)
{
    if (i < n && a[i] != 0)
    {
        cout << a[i] << " ";
        pri(2 * i + 1, a, n);
        pri(2 * i + 2, a, n);
    }
}
int main()
{
    int sum;
    cin >> sum;
    int num;
    while (sum--)
    {
        cin >> num;
        int* arr = new int[num];
        for (int i = 0; i < num; i++)
        {
            cin >> arr[i];
        }
        int i = 0;
        pri(i, arr, num);
        cout << endl;
    }
    
 

    return 0;
}

---