993. 二叉树的堂兄弟节点

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @param {number} x
 * @param {number} y
 * @return {boolean}
 */
var isCousins = function(root, x, y) {
    let tree = [];
    tree.push({node:root,level:0});
    let p1=0,p2=0,h1=0,h2=0;
    while(tree.length>0){
        cur = tree.shift();
        if(cur.node.left && cur.node.left.val === x){
            p1 = cur.node.val;
            h1 = cur.level;
        }        
        if(cur.node.left && cur.node.left.val === y){
            p2 = cur.node.val;
            h2 = cur.level;
        }
        if(cur.node.right && cur.node.right.val === x){
            p1 = cur.node.val;
            h1 = cur.level;
        }        
        if(cur.node.right && cur.node.right.val === y){
            p2 = cur.node.val;
            h2 = cur.level;
        }
        
        if(p1 && p2 && h1 && h2 && p1!==p2 && h1===h2){
            return true;
        }
        if(cur.node.left)tree.push({node:cur.node.left,level:cur.level+1});
        if(cur.node.right)tree.push({node:cur.node.right,level:cur.level+1});
    }
    return false;
};