D (1064) : DS二叉树——二叉树之父子结点

---

一、题目描述

给定一颗二叉树的逻辑结构，（先序遍历的结果，空树用字符‘0’表示，例如AB0C00D00），建立该二叉树的二叉链式存储结构。

编写程序输出该树的所有叶子结点和它们的父亲结点

---

二、输入与输出

1.输入

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

第二行起，按照题目表示的输入方法，输入每个二叉树的先序遍历，连续输入t行

3
AB0C00D00
AB00C00
ABCD0000EF000

---

2.输出

C D 
B A 
B C 
A A 
D F 
C E 

---

三、参考代码

#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()
    {
        LessonNum(root);
        cout << endl;
        LeafAndParent(root);
        cout << endl;
    }
};

int main()
{
    int sum;
    cin >> sum;
    string str;
    while (sum--)
    {
        cin >> str;
        Tree t;
        t.Create(str);
        t.pri();   
    }
    
 

    return 0;
}

---