Design Gurus Logo
Leaf-Similar Trees (easy)

Problem Statement

Given the two root nodes root1 and root2 of two different binary trees, return true if both binary trees are leaf-similar trees. Otherwise, return false.

All leaves of the binary tree in left-to-right order create a leaf sequence. If both trees have same leaf sequence, they are considered as leaf-similar tree.

Examples

Example 1:

  • Input: root1 = [5,2,7,1,3,6,8], root2 = [7,5,2,1,3,6,8]
Image
  • Expected Output: True
  • Justification: Both trees have the same leaf sequence [1,3,6,8], making them leaf-similar despite their different structures.

Example 2:

  • Input: root1 = [7, null, 8], root2 = [7,8]
Image
  • Expected Output: True
  • Justification: Both Tree A and Tree B have the same leaf sequence [8], making them leaf-similar.

Example 3:

  • Input: root1 = [1,2,4,null,null,5,6], root2 = [1,2,5,null,null,4,6]
Image
  • Expected Output: False
  • Justification: The leaf sequence for Tree A is [2,5,6], while for Tree B, it is [2,4,6]. Since the sequences do not match in order, the trees are not considered leaf-similar.

Try it yourself

Try solving this question here:

Python3
Python3
. . . .

.....

.....

.....

Unlock this and all other premium problems.
No code editor for this lesson
This lesson focuses on concepts and theory