1367：查找二叉树(tree_a)

#include<bits/stdc++.h>
using namespace std;
struct Node
{
	int val;
	int left, right;
};
Node tree[50];
int ct, ans, x;
void inorder(int r)
{
	if(r == 0)
		return;
	inorder(tree[r].left);
	ct++;
	if(tree[r].val == x)
		ans = ct;
	inorder(tree[r].right);
}
int main()
{
	int n, v, l, r;
	cin >> n >> x;
	for(int i = 1; i <= n; ++i)
	{
		cin >> v >> l >> r;
		tree[i].val = v;
		tree[i].left = l;
		tree[i].right = r;
	}
	inorder(1);
	cout << ans;
	return 0;
}