二叉树高度 struct Node { int data; Node* left; Node* right; }; int max(int a, int b) { return a > b ? a : b; } struct Node* root; int FindHeight(struct Node* root) { if (!root) { return -1; } return max(FindHeight(root->left), FindHeight(root->right)); }