#Consider all the leaves of a binary tree
#from left to right order, the values of those leaves form a leaf value sequence.
#For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8).
#
#Two binary trees are considered leaf-similar if their leaf value sequence is the same.
#
#Return true if and only if the two given trees with head nodes root1 and root2 are leaf-similar.
#that means all the leaf nodes in both the trees should be same 
# 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:
        self.v1=[]
        self.v2=[]
        
        
        def order(root,v):
            if root ==None:
                return 
            
            if not root.left and not root.right:
                v.append(root.val)
            
            order(root.left,v)
            order(root.right,v)
            
        order(root1,self.v1)
        order(root2,self.v2)
        
        return self.v1==self.v2
    
                
                
