-
Notifications
You must be signed in to change notification settings - Fork 0
/
572.py
62 lines (53 loc) · 1.37 KB
/
572.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
# 572. Subtree of Another Tree
# Given two non-empty binary trees s and t,
# check whether tree t has exactly the same structure and node values with a subtree of s.
# A subtree of s is a tree consists of a node in s and all of this node's descendants.
# The tree s could also be considered as a subtree of itself.
# Example 1:
# Given tree s:
# 3
# / \
# 4 5
# / \
# 1 2
# Given tree t:
# 4
# / \
# 1 2
# Return true, because t has the same structure and node values with a subtree of s.
# Example 2:
# Given tree s:
# 3
# / \
# 4 5
# / \
# 1 2
# /
# 0
# Given tree t:
# 4
# / \
# 1 2
# Return false.
# Definition for a binary tree node.
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def isSametree(self, s: TreeNode, t: TreeNode) -> bool:
if not s and not t:
return True
if not s or not t:
return False
return s.val == t.val and self.isSametree(
s.right, t.right) and self.isSametree(s.left, t.left)
def isSubtree(self, s: TreeNode, t: TreeNode) -> bool:
if s == None:
return s == t
if s == t:
return True
if self.isSametree(s, t):
return True
return self.isSubtree(s.left, t) or self.isSubtree(s.right, t)