class Solution:
    def leafSimilar(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> bool:
        leaf_seq1: list[int] = self.traverse_tree(root1)
        leaf_seq2: list[int] = self.traverse_tree(root2)

        return leaf_seq1 == leaf_seq2


    def traverse_tree(self, node: Optional[TreeNode]) -> list[int]:
        leaves: list [int] = []
        values: list[int] = []

        if not node:
            return

        if not node.right and not node.left:
            leaves.append(node.val)

        values = self.traverse_tree(node.left)
        if values:
            leaves += values

        values = self.traverse_tree(node.right)
        if values:
            leaves += values

        return leaves