#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 1e6 + 10;
struct Node
{
int l, r;
}tr[N];
int dfs(int root)
{
if(root == 0)
return 0;
return 1 + max(dfs(tr[root].l), dfs(tr[root].r));
}
int main()
{
int n;
cin >> n;
for(int i = 1; i <= n; i ++)
cin >> tr[i].l >> tr[i].r;
cout << dfs(1) << endl;
return 0;
}
P4913 二叉树深度
最新推荐文章于 2024-07-19 13:59:11 发布