offer树的子结构

def HasSubtree(self,pRoot1,pRoot2):
    if pRoot2==None or pRoot1 ==None:
        return False

    def hasEqual(pRoot1,pRoot2):
        if pRoot2 ==None:
            return True
        if pRoot1 ==None:
            return False
        if pRoot1.val == pRoot2.val:
            if pRoot2.left == None:
                leftEqual = True
            else:
                leftEqual = hasEqual(pRoot1.left,pRoot2.left)
            if pRoot2.right == None:
                rightEqual =True
            else:
                rightEqual = hasEqual(pRoot1.right,pRoot2.right)
            return leftEqual and rightEqual
        return False

    if pRoot1.val ==pRoot2.val:
        ret =hasEqual(pRoot1,pRoot2)
        if ret:
            return True