二叉树最大宽度和高度

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int m,n,sd,sum=0;
int abs[10000];
struct node
{
    int z;
    int y;
}tree[1000];
void dfs(int x,int step)
{
    if(step>sum)
    sum=step;
    if(tree[x].z!=0)
    {
        abs[step]++;
        dfs(tree[x].z,step+1);
    }
    if(tree[x].y!=0)
    {
        abs[step]++;
        dfs(tree[x].y,step+1);
    }
    else return;
}
int main()
{
    int n,jk=-1;;
    cin>>n;
    if(n==1)
    jk=1;
    for(int i=1;i<=n;i++)
    {
        cin>>tree[i].z>>tree[i].y;
        
    }
    dfs(1,1);
    
    for(int i=1;i<=sum;i++)
    {
        if(jk<abs[i])swap(jk,abs[i]);
    }
    cout<<jk<<" "<<sum;
    return 0;
}