题目描述
输入两棵二叉树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 DoesTree1HaveTree2(self,pRoot1,pRoot2):
if pRoot2==None:
return True
if pRoot1==None:
return False
if pRoot1.val!=pRoot2.val:
return False
return self.DoesTree1HaveTree2(pRoot1.left , pRoot2.left) and self.DoesTree1HaveTree2(pRoot1.right , pRoot2.right)
def HasSubtree(self, pRoot1, pRoot2):
# write code here
if pRoot1==None or pRoot2==None:
return False
result=False
if pRoot1!=None and pRoot1!=None:
if pRoot1.val==pRoot2.val:
result=self.DoesTree1HaveTree2(pRoot1,pRoot2)
if result==False:
result=self.HasSubtree(pRoot1.left,pRoot2)
if result==False:
result=self.HasSubtree(pRoot1.right,pRoot2)
return result
掌握的不好,再理解