Description
The leaf value sequence is the sequence of leaf values from left to right. Two binary trees are leaf-similar if their leaf value sequences are equal. Return true if they are leaf-similar.
Examples
Input:
root1 = [3,5,1], root2 = [3,5,1]Output:
trueExplanation:
Same leaf sequence.
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:
trueExplanation:
Both trees have the same leaf sequence: [6, 7, 4, 9, 8].
Input:
root1 = [1,2,3], root2 = [1,3,2]Output:
falseExplanation:
root1 has leaf sequence [2,3] (left to right), while root2 has leaf sequence [3,2]. Since the leaf sequences are different, the trees are not leaf-similar.
Constraints
- •
1 ≤ nodes ≤ 200