Same Tree Problem

Same Tree Problem — ExecCode Easy DSA Practice

Solve the Same Tree problem on ExecCode. Free online easy DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Examples

Input p = [1, 2, 3], q = [1, 2, 3]; Output true

Constraints

0 ≤ nodes ≤ 100 -10^4 ≤ Node.val ≤ 10^4

Practice Same Tree free on ExecCode. Browse DSA problems, topic map, and placement guides.