树的子结构

问题描述

输入两棵二叉树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 HasSubtree(self, pRoot1, pRoot2):
        # write code here
        result=False
        if pRoot1 and pRoot2:
            if pRoot1.val==pRoot2.val:
                result=self.treeFind(pRoot1,pRoot2)
            if result==False:
                result=self.HasSubtree(pRoot1.left,pRoot2)
            if result==False:
                result=self.HasSubtree(pRoot1.right,pRoot2)
        return result
    def treeFind(self,R1,R2):
        if R2==None:
            return True
        if R1==None:
            return False
        if R1.val!=R2.val:
            return False
        return self.treeFind(R1.left,R2.left) and self.treeFind(R1.right,R2.right)