c++之树的构建与查找

#include<iostream>
using namespace std;

template<class T>
class tNode
{
public:
    T data;
    int id;
    tNode *pL,*pR;
};

const int MAXSIZE= 2000;
tNode<int> tree[MAXSIZE];
int N;

int main()
{
    int a,L,R;
    cin>>N;
    for(int i =1; i <= N; i++)
    {
        cin >> a>>L>>R;
        tree[a].data = a;
        if(!L)
        {
            tree[a].pL = NULL;
        }
        else
            tree[a].pL = &tree[L];
        if(!R)
        {
            tree[a].pR = NULL;
        }
        else
            tree[a].pR = &tree[R];
    }
    
    //搜索
    tNode<int> *p = &tree[1];
    while(p)
    {
        cout << p->data << " ";
        p = p->pL;
    }
    return 0;
}