剑指offer 树的子结构 @python

剑指offer 树的子结构 @python

题目描述

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

---

Solution

• 第一步：现在树A中查找与根节点值一样的结点。
• 第二步：判断树A中该结点以下的结构是否和树B一样

Note: 注意异常检测。

---

# -*- coding: utf-8 -*-
"""
Created on Fri Mar 23 10:06:34 2018

@author: Saul
"""

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def DoesHaveSubtree(self, pRoot1, pRoot2):
        if pRoot2 == None:
            return True
        if pRoot1 == None:
            return False
        if pRoot1.val != pRoot2.val:
            return False
        return self.DoesHaveSubtree(pRoot1.left, pRoot2.left) \
    and self.DoesHaveSubtree(pRoot1.right, pRoot2.right)

    def HasSubtree(self, pRoot1, pRoot2):
        # write code here
        result = False
        if pRoot1 and pRoot2:
            if pRoot1.val == pRoot2.val:
                result = self.DoesHaveSubtree(pRoot1, pRoot2)
            if result is False:
                result = self.HasSubtree(pRoot1.left, pRoot2)
            if result is False:
                result = self.HasSubtree(pRoot1.right, pRoot2)
        return result