输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
递归遍历A树,若遇到A树的节点和B树根节点相同,则开始判断是否为子树。
class Solution:
def HasSubtree(self, pRoot1, pRoot2):
result = False
if not pRoot1 or not pRoot2:
return False
if pRoot1.val == pRoot2.val
result == self.equal(pRoot1, pRoot2)
if result == False:
result == self.HasSubtree(pRoot1.left, pRoot2)
if result == False:
result == self.HasSubtree(pRoot1.right, pRoot2)
return result
def equal(self, pRoot1, pRoot2):
if pRoot2 == None:
return True
if pRoot1 == None:
return False
if pRoot1.val != pRoot2.val:
return False
return self.equal(pRoot1.left, pRoot2.left) and self.equal(pRoot1.right, pRoot2.right)