872_leaf-similar_trees.py

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def leafSimilar(self, root1: TreeNode, root2: TreeNode) -> bool:

        def preorder(root: TreeNode, leaf_seq: List[int]):
            if root == None:
                return None
            elif (root != None) and (root.left == None) and (root.right == None):
                leaf_seq.append(root.val)
            else:
                preorder(root.left, leaf_seq)
                preorder(root.right, leaf_seq)

        leaf_seq1 = []
        leaf_seq2 = []
        preorder(root1, leaf_seq1)
        preorder(root2, leaf_seq2)
        if leaf_seq1 == leaf_seq2:
            return True
        else:
            return False

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''