剑指offer 之 树的子结构

# coding:utf-8

'''
面试18
题目描述
输入两棵二叉树A，B，判断B是不是A的子结构。（ps：我们约定空树不是任意一个树的子结构） 
'''

class TreeNode:
	def __init__(self, x):
		self.val = x
		self.left = None
		self.right = None

class Solution :
	def HasSubtree(self, pRoot1, pRoot2):
		# write code here
		result = False

		if not pRoot1 or not pRoot2:
			return result

		if pRoot1.val == pRoot2.val:
			result = self.DoesTree1HasTree2(pRoot1, pRoot2)
		if not result:
			result = self.HasSubtree(pRoot1.left, pRoot2)
		if not result:
			result = self.HasSubtree(pRoot1.right, pRoot2)
		return result
		
	def DoesTree1HasTree2(self, pRoot1, pRoot2):
		if not pRoot2:
			return True
		if not pRoot1:
			return False
		if pRoot1.val != pRoot2.val:
			return False
		return self.DoesTree1HasTree2(pRoot1.right, pRoot2.right) and self.DoesTree1HasTree2(pRoot1.left, pRoot2.left)

pRoot1 = TreeNode(8)
pRoot2 = TreeNode(8)
pRoot3 = TreeNode(7)
pRoot4 = TreeNode(9)
pRoot5 = TreeNode(2)
pRoot6 = TreeNode(4)
pRoot7 = TreeNode(7)
pRoot1.left = pRoot2
pRoot1.right = pRoot3
pRoot2.left = pRoot4
pRoot2.right = pRoot5
pRoot5.left = pRoot6
pRoot5.right = pRoot7

pRoot8 = TreeNode(8)
pRoot9 = TreeNode(9)
pRoot10 = TreeNode(2)
pRoot8.left = pRoot9
pRoot8.right = pRoot10

S = Solution()
print(S.HasSubtree(pRoot1, pRoot8))