LeetCode/100.same-tree.python2.py at master · replicaCortex/LeetCode · GitHub

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
# @leet start
# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def isSameTree(self, p, q):
        """
        :type p: Optional[TreeNode]
        :type q: Optional[TreeNode]
        :rtype: bool
        """

        def NLR(node, tmp=None):
            if tmp == None:
                tmp = []

            if node != None:
                tmp.append(node.val)
            else:
                tmp.append("Null")
                return 0

            NLR(node.left, tmp)

            NLR(node.right, tmp)

            return tmp

        return NLR(q) == NLR(p)


# @leet end