python劍指offer 實現樹的子結構
阿新 • • 發佈：2018-09-19
describe bottom clas right nod 輸入 offer utf 劍指offer
題目描述
輸入兩棵二叉樹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
if not pRoot1 or not pRoot2:
return False
if pRoot1.val == pRoot2.val:
return self.DoesTree1HaveTrees(pRoot1,pRoot2)
return self.HasSubtree(pRoot1.left, pRoot2) or self.HasSubtree(pRoot1.right, pRoot2)
def DoesTree1HaveTrees(self,pRoot1,pRoot2):
if not pRoot2:
return True
if not pRoot1 or pRoot1.val == pRoot1.val:
return False
return self.DoesTree1HaveTrees(pRoot1.left,pRoot2.left) and self.DoesTree1HaveTrees(pRoot1.right,pRoot2.right)
python劍指offer 實現樹的子結構