-
Notifications
You must be signed in to change notification settings - Fork 0
/
same_tree.py
53 lines (47 loc) · 1.04 KB
/
same_tree.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
# https://leetcode.com/problems/same-tree/
# Given two binary trees, write a function to check if they are the same or not.
#
# Two binary trees are considered the same if they are structurally identical and the nodes have the same value.
# Example 1:
#
# Input: 1 1
# / \ / \
# 2 3 2 3
#
# [1,2,3], [1,2,3]
#
# Output: true
#
# Example 2:
#
# Input: 1 1
# / \
# 2 2
#
# [1,2], [1,null,2]
#
# Output: false
#
# Example 3:
#
# Input: 1 1
# / \ / \
# 2 1 1 2
#
# [1,2,1], [1,1,2]
#
# Output: false
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
def isSameTree(p: TreeNode, q: TreeNode) -> bool:
if not p and not q:
return True
elif not p or not q:
return False
elif p.val != q.val:
return False
else:
return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)