Leetcode 872. Leaf-Similar Trees

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def leafSimilar(self, root1: TreeNode, root2: TreeNode) -> bool:
        leaf1,leaf2=[],[]
        stack=[root1]
        while stack:
            node=stack.pop()
            if (not node.left) and (not node.right):
                leaf1.append(node.val)
            else:
                if node.right:
                    stack.append(node.right)
                if node.left:
                    stack.append(node.left)
        stack=[root2]
        while stack:
            node=stack.pop()
            if (not node.left) and (not node.right):
                leaf2.append(node.val)
            else:
                if node.right:
                    stack.append(node.right)
                if node.left:
                    stack.append(node.left)
        return leaf1==leaf2