Leaf-Similar Trees

Problem statement

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.

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: true

Example 2:

Input: root1 = [1,2,3], root2 = [1,3,2]Output: false

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].

My solution

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root1
 * @param {TreeNode} root2
 * @return {boolean}
 */
var leafSimilar = function(root1, root2) {
    
    function parseBST(root) {
        const leaf = [];
        const stack = [root];
        
        while (stack.length > 0) {
            const curr = stack.pop();
            
            if (!curr.left && !curr.right) {
                leaf.push(curr.val);
            }
            
            if (curr.left) {
                stack.push(curr.left);
            }
            
            if (curr.right) {
                stack.push(curr.right);
            }
        }
        return leaf;
    }
    
    const leafRoot1 = parseBST(root1);
    const leafRoot2 = parseBST(root2);
    
    if (leafRoot1.length !== leafRoot2.length) {
        return false;
    }
    
    for (let i = 0; i < leafRoot1.length; i++) {
        const curr = leafRoot1[i];
        const curr2 = leafRoot2[i];
        if (curr !== curr2) {
            return false;
        }
    }
    
    return true;
};