解题思路:
(1)求出x,y的高度和对应的父节点,分别判断即可
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
void dfs(TreeNode* root,int x,int y,TreeNode* &p,TreeNode* &q,int h,int &dp,int &dq) {
if(root) {
if(root->val==x) dp=h;
else if(root->val==y) dq=h;
if(root->left) {
if(root->left->val==x) p = root;
else if(root->left->val==y) q = root;
}
if(root->right) {
if(root->right->val==x) p = root;
else if(root->right->val==y) q = root;
}
dfs(root->left,x,y,p,q,h+1,dp,dq);
dfs(root->right,x,y,p,q,h+1,dp,dq);
}
}
bool isCousins(TreeNode* root, int x, int y) {
TreeNode *p=NULL,*q=NULL;
int h=0,dp=0,dq=0;
dfs(root,x,y,p,q,h,dp,dq);
if(p!=q && dp==dq) return true;
else return false;
}
};