LeetCode 993. 二叉树的堂兄弟节点

LeetCode 993. 二叉树的堂兄弟节点

给定两个节点，如果节点的深度相同而父节点不同，则称为堂兄弟节点，判断是否是堂兄弟节点

题解：
可以采用层次遍历的方式，在遍历的过程中，记录x和y节点的深度与父节点、。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isCousins(TreeNode root, int x, int y) {
        if(root == null)
            return false;
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root);
        int xdepth = -1, ydepth = -1,depth = 0;
        TreeNode xf = null,yf = null;
        while(!queue.isEmpty()){
            int size = queue.size();
            for(int i = 0; i < size; i++){
                TreeNode top = queue.poll();
                if(top.left != null){
                    if(top.left.val == x)
                        { xdepth = depth; xf = top;}
                    else if(top.left.val == y)
                        {ydepth = depth; yf = top;}
                    queue.offer(top.left);
                }
                if(top.right != null){
                    if(top.right.val == x)
                        { xdepth = depth; xf = top;}
                    else if(top.right.val == y)
                        {ydepth = depth; yf = top;}
                    queue.offer(top.right);
                }
            }
            depth++;
            if(xf != null && yf != null)
                break;
        }
        if(xf == null || yf == null)
            return false;
        return xf != yf && xdepth == ydepth;
    }

}

题目连接：https://leetcode-cn.com/problems/cousins-in-binary-tree/