Practice Leaf-Similar Trees

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#872

LeetCode Problem

Leaf-Similar Trees

Tree Depth-First Search Binary Tree

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.

Source: Leaf-Similar Trees on LeetCode. Use the original task for its coding environment and submissions.

Examples

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

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free