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.

实现：

public boolean isCousins(TreeNode root, int A, int B){
	if(root == null)
		return false;

	Queue<TreeNode> queue = new LinkedList<>();
	queue.offer(root);
	while(!queue.isEmpty()){
		int size = queue.size();
		boolean isAexist = false;
		boolean isBexist = false;
		for(int i = 0; i < size; i++){
			TreeNode cur = queue.poll();
			if(cur.val == A) isAexist = true;
			if(cur.val == B) isBexist =true;
			if(cur.left != null && cur.right != null) { 
				if (cur.left.val == A && cur.right.val == B) { 
					return false;
				}
				if (cur.left.val == B && cur.right.val == A) { 
					return false;
				}
			}
			if (cur.left != null) {
				queue.offer(cur.left);
			}
			if (cur.right != null) {
				queue.offer(cur.right);
			}
		}
		if (isAexist && isBexist)  return true;
	}
	return false;
}