Similar-Leaf Trees

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 in their leaf value sequence is the same.

Return 1 if and only if the two given trees with head nodes root1 and root2 are leaf-similar else return 0.

Class TreeNode:
    val (int)
    left (TreeNode)
    right (TreeNode)

Input Format

First parameter - TreeNode root1

Second Parameter - TreeNode root2

Output Format

Return the number.

Example 1:

Input:
    root1 = [3 5 1 6 2 9 8 null null 7 4]   
    root2 = [3 5 1 6 7 4 2 null null null null null null 9 8]
Output:
    1
Explanation:
    Return 1 because both trees are leaf similar

Example 2:

Input:
    root1 = [1 2 3]
    root2 = [1 3 2]
Output:
    0
Explanation:
    Returning 0 because both trees are not leaf similar

Constraints

• The number of nodes in each tree will be in the range [1, 200].
• Both of the given trees will have values in the range [0, 200].
• Expected Time Complexity: O(N)
• Expected Space Complexity: O(h1+h2), where h1 and h2 are height of both the trees.