题目
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
思路
递归
代码
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def SubTree(self, root1, root2):
if not root1 and not root2 or root1 and not root2:
return True
if not root1 and root2:
return False
if root1.val == root2.val:
return self.SubTree(root1.left, root2.left) and self.SubTree(root1.right, root2.right)
return False
def HasSubtree(self, pRoot1, pRoot2):
# write code here
if not pRoot2: return False
result = False
if pRoot1 and pRoot1.val == pRoot2.val:
result = self.SubTree(pRoot1, pRoot2)
if pRoot1:
return result or self.HasSubtree(pRoot1.left, pRoot2) or self.HasSubtree(pRoot1.right, pRoot2)
return result