每日一题:993. 二叉树的堂兄弟节点

解题思路

利用BFS进行遍历
因为树中所有值为唯一，因此不会有重复的节点，所以可以直接记录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) {
        Map<Integer,Integer> layer = new HashMap<>();
        Map<Integer,Integer> father = new HashMap<>();
        LinkedList<TreeNode> list = new LinkedList<>();
        if(root==null) return false;
        if(root.val==x || root.val==y) return false;
        int lay = 1;
        list.add(root);
        while(!list.isEmpty()){
            lay++;
            int n = list.size();
            for(int i=0;i<n;i++){
                TreeNode node = list.getFirst();
                if(node.val==x){layer.put(x,lay);}
                if(node.val==y){layer.put(y,lay);}
                list.removeFirst();
                if(node.left!=null){ 
                    if(node.left.val==x) father.put(x,node.val);
                    if(node.left.val==y) father.put(y,node.val);
                    list.add(node.left);
                }
                if(node.right!=null){
                    if(node.right.val==x) father.put(x,node.val);
                    if(node.right.val==y) father.put(y,node.val);
                    list.add(node.right);
                }
            }
        }
        return layer.get(x)==layer.get(y) && father.get(x)!=father.get(y);
    }
}