Leetcode 993. Cousins in Binary Tree

Leetcode 993. Cousins in Binary Tree

In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1.

Two nodes of a binary tree are cousins if they have the same depth, but have different parents.

We are given the root of a binary tree with unique values, and the values x and y of two different nodes in the tree.

Return true if and only if the nodes corresponding to the values x and y are cousins.

Example 1:

Input: root = [1,2,3,4], x = 4, y = 3
Output: false

Example 2:

Input: root = [1,2,3,null,4,null,5], x = 5, y = 4
Output: true
Example 3:

Input: root = [1,2,3,null,4], x = 2, y = 3
Output: false

Note:

The number of nodes in the tree will be between 2 and 100.
Each node has a unique integer value from 1 to 100.

解析： 题目意思是 给一棵二叉树，然后给两个节点，看他们是否是堂兄弟，堂兄弟就是处在同一层，但是父节点不一样。

其实就是求节点的深度和父亲节点

代码：

struct TreeNode {
     int val;
     TreeNode *left;
     TreeNode *right;
     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
	void dfs(TreeNode* p, TreeNode* &pre, int x,int cur_depth, vector<int> &ans)
	{
		if (p == nullptr) return;
		if (p->val == x)
		{
			ans[0] = cur_depth;
			ans[1] = pre->val;
 			return;
		}
		dfs(p->right, p, x, cur_depth + 1, ans);
		dfs(p->left, p, x, cur_depth + 1, ans);
	}

	bool isCousins(TreeNode* root, int x, int y)
	{
		int depth1 = 0;
		int depth2 = 0;
		TreeNode* pa1 = root;
		TreeNode* pa2 = root;
		vector<int> ans1(2);
		vector<int> ans2(2);
		dfs(root, pa1, x, 0, ans1);
		dfs(root, pa2, y, 0, ans2);
	//	cout << ans1[0] <<  " " << ans1[1] << " " << ans2[0]<<" " << ans2[1] << endl;
		if (ans1[0] == ans2[0] && ans1[1] != ans2[1]) return true;
		return false;
	}
};



int main()
{ 
	Solution so;
	TreeNode* p1 = new TreeNode(1);
	TreeNode* p2 = new TreeNode(2);
	TreeNode* p3 = new TreeNode(3);
	TreeNode* p4 = new TreeNode(4);
	TreeNode* p5 = new TreeNode(5);

	p1->left = p2;
	p1->right = p3;
	p2->right = p4;
	p3->right = p5;

	cout << so.isCousins(p1, 5, 4);

	return 0;
}