题解 | #树的子结构#

/* function TreeNode(x) {
    this.val = x;
    this.left = null;
    this.right = null;
} */
function issame(pRoot1,pRoot2){
    if(pRoot2===null) return true
    else if(pRoot1===null) return false
    else if(pRoot1.val!==pRoot2.val) return false
    return issame(pRoot1.left,pRoot2.left)&& issame(pRoot1.right,pRoot2.right)
}


function HasSubtree(pRoot1, pRoot2)
{
    if(pRoot1===null||pRoot2===null) return false
    return issame(pRoot1,pRoot2)||HasSubtree(pRoot1.left,pRoot2)||HasSubtree(pRoot1.right,pRoot2)
}
module.exports = {
    HasSubtree : HasSubtree
};