可以的

#include <iostream>
using namespace std;

struct node {
	int left, right;
} a[10005];
int deep = 0;

void treedeep(int root, int k) {
	if (root == 0)
		return;
	deep = max(deep, k);
	treedeep(a[root].left, k + 1);
	treedeep(a[root].right, k + 1);
}

int main() {
	int n, x, y;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> x >> y;
		a[i] = {x, y};
	}
	treedeep(1, 1);
	cout << deep;
	return 0;
}