Compare Leaf Traversal
You are given the roots of two binary trees. Consider the sequence of leaf values from left to right in each tree, known as the leaf value sequence.
Your task is to determine whether both trees have the same leaf value sequence.
A leaf node is a node with no left or right child.
Return true if both leaf value sequences are identical; otherwise, return false.
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
Explanation: Both trees produce the same leaf value sequence: 6, 7, 4, 9, 8.
Input: root1 = [1,2,3], root2 = [1,3,2]
Output: false
Explanation: The first tree's leaf sequence is 2, 3, while the second's is 3, 2. They do not match.
Input: root1 = [1], root2 = [1]
Output: true
Explanation: Both single-node trees have the identical leaf sequence: 1.
- 1 = Number of nodes in each tree = 200
- -10? = Node.data = 10?
See how the best solutions work
Approach, complexity and clean code in every language. Sign in to unlock the editorial.
Keep every attempt
Your submissions, results and runtime history live here. Sign in to start your streak.
1 2 3 4 5 6 7 1 2 3 4 5 6 7
true
10 5 15 2 7 12 20 10 8 18 2 7 12 20
true