python判断 t1 树是否有与 t2 树拓扑结构完全相同的子树

Posted 2021-06-28 Data+Science+Insight

python判断 t1 树是否有与 t2 树拓扑结构完全相同的子树

 

 

 

# 给定彼此独立的两棵二叉树，判断 t1 树是否有与 t2 树拓扑结构完全相同的子树。

class Node():
    def __init__(self,x):
        self.val = x
        self.left = None
        self.right = None        
def HasSubtree(pRoot1,pRoot2):
    if not pRoot1 or pRoot2:
        return False
    return is_Subtree(pRoot1,pRoot2) or HasSubtree(pRoot1.left,pRoot2) or HasSubtree(pRoot1.right,pRoot2)
def is_Subtree(A,B):
    if not B:
        return True
    if not A or A.val != B.val:
        return False
    return is_Subtree(A.left,B.left) and is_Subtree(A.right,B.right)

#

root = Node(1)
root.left = Node(2)
root.right =