树的存储结构

//1、第一行一个n，代表这个树有n个节点，接下来输入n行，第i行输入两个数字，li，ri，代表第i个节点的左儿子右儿子（节点序号从1编号到n），如果没有左儿子或者右儿子，就用-1代替，输出它的层序遍历

#include <cstdio>
#include <queue>
#include <iostream>

using namespace std;

struct treenode
{
    int lchild;
    int rchild;
    char val;

    treenode()
    {
        lchild = rchild = -1;
    }

    treenode(char x)
    {
        val = x;
        lchild = rchild = -1;
    }
};

void leverorder(int root, treenode a[200])
{
    if ((a[root].lchild==-1)&&(a[root].rchild==-1))
        return;
    else
    {
        queue<treenode> q;
        q.push(a[root]);
        while (!q.empty())
        {
            cout << a[root].val << endl;
            q.pop();
            if (a[root].lchild != 0)
                q.push(a[a[root].lchild]);
            if (a[root].rchild != 0)
                q.push(a[a[root].rchild]);
        }
    }
}

treenode a[200];
int indepth[200] = {0};

int main()
{
    int n;
    scanf("%d", &n);
    int l, r;
    char val;
    for (int i = 1; i <= n; i++)
    {
        getchar();
        scanf("%c %d %d", &val, &l, &r);
        a[i].lchild = l;
        if (l != -1)
            indepth[l]++;
        a[i].rchild = r;
        if (r != -1)
            indepth[r]++;
        a[i].val = val;
    }
    int root = -1;
    for (int i = 1; i <= n; i++)
    {
        if (!indepth[i])
        {
            root = i;
            break;
        }
    }
    leverorder(root, a);
}

//第一行一个n，代表这个树有n个节点，接下来输入n行，每一行输入一个数字和一个字符，代表第i个节点的父亲（节点序号从1到n）和第i个节点的值，输出每一个节点的儿子值
#include <cstdio>
#include <vector>

using namespace std;

struct treenode
{
    int parent;
    char val;
    vector<int>child;
    treenode()
    {
        parent = -1;
    }

    treenode(char x)
    {
        val = x;
        parent = -1;
    }
};

treenode a[200];

int main()
{
    int n;
    scanf("%d", &n);
    int parent;
    char val;
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &parent);
        getchar();
        scanf("%c", &val);
        a[parent].child.push_back(i);
        a[i].val=val;
    }
    for (int i = 1; i <= n; i++)
    {
        for(int j=0;j<a[i].child.size();j++)
        {
            printf("%c ",a[a[i].child[j]].val);
        }
        printf("\n");
    }
}