Python3解leetcode 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

思路：

考虑递归解法，将大问题化解为无数个类似的小问题

# 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, p: TreeNode, q: TreeNode) -> bool:

        if p == None and q ==None:

            return True

        elif p == None or q ==None or p.val != q.val:

            return False

        if p.val == q.val :

            return self.isSameTree(p.left,q.left)  and self.isSameTree(p.right,q.right)

巴特西

Python3解leetcode Same Tree

最新文章

热门文章