-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathsame.py
More file actions
45 lines (37 loc) · 1.2 KB
/
same.py
File metadata and controls
45 lines (37 loc) · 1.2 KB
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
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def isSameTree(self, p, q):
"""
:type p: TreeNode
:type q: TreeNode
:rtype: bool
"""
if p and q:
# check for values to be equal from root through the left and through the right
return p.val == q.val and self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
return p is q # Similar to p==q
"""
# works, but not sure how to handle the null character - think about it
# Perform InOrder Traversal and verify the trees - (Left,Root,Right)
tree = []
def inOrder(node):
if node:
inOrder(node.left)
tree.append(node.val)
inOrder(node.right)
inOrder(p)
tree1 = tree
tree = []
inOrder(q)
tree2 = tree
print tree1,tree2
if tree1 == tree2:
return True
else:
return False
"""