AcWing 37. 树的子结构
原题链接
简单
作者:
YoloVMe50
,
2023-12-11 17:11:13
,
所有人可见
,
阅读 50
python代码
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
from collections import deque
class Solution(object):
def hasSubtree(self, pRoot1, pRoot2):
if not pRoot1 or not pRoot2:
return False
if self.isSame(pRoot1,pRoot2):
return True
return self.hasSubtree(pRoot1.left,pRoot2) or self.hasSubtree(pRoot1.right,pRoot2)
def isSame(self,p1,p2):
if not p2:
return True
if not p1 or p1.val != p2.val:
return False
return self.isSame(p1.left,p2.left) and self.isSame(p1.right,p2.right)