71. LeetCode 100. 相同的树

• 标签： 树
• 难度： 简单

---

• 题目描述

• 我的解法

递归是很自然的思路。注意结点是 None 的多种情况。感觉自己写的代码逻辑好像不够优雅，瞅瞅讨论，Yi ~, 算了，还是我的清楚。

# 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 invertTree(self, root):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
     # 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 not p or not q:
            if not p and not q:
                return True
            else:
                return False
        else:
            if p.val != q.val:
                return False
            else:
                return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)

• 其他解法

暂略。