MLE求调

using namespace std;
int maxd=-1;
struct node{
    int left,right;
}tree[100005];
void dfs(int id,int deep)
{
    if(id==0) maxd=max(deep,maxd);
    dfs(tree[id].left,deep+1);
    dfs(tree[id].right,deep+1);
}
int main()
{
    int n,l,r;
    cin>>n;
    for(int i=1;i<=n;i++)  cin>>tree[i].left>>tree[i].right;
    dfs(1,1);    
    cout<<maxd;
    return 0;
}