Skip to content

Latest commit

 

History

History
11 lines (8 loc) · 401 Bytes

File metadata and controls

11 lines (8 loc) · 401 Bytes

Problem 4: Identical Blueprints

Problem Statement

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.

Input Format

  • Roots of two binary trees p and q.

Example

Input: p = [1, 2, 3], q = [1, 2, 3]
Output: True