Subtree of Another Tree — easy DSA Problem

Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values as subRoot and false otherwise.

A subtree of a binary tree tree is a tree that consists of a node in tree and all of this node's descendants. The tree tree itself is also considered a subtree of itself.

Example 1:

Input:
3 4 5 1 2
4 1 2
Output: true

Example 2:

Input:
3 4 5 1 2 null null null null 0
4 1 2
Output: false

Constraints:

The number of nodes in the root tree is in the range [1, 2000]
The number of nodes in the subRoot tree is in the range [1, 1000]
-10⁴ ≤ root.val, subRoot.val ≤ 10⁴

Input format: Two lines, each with BFS level-order (null for missing nodes).

Output format: true or false.