Same Tree

EasyGraded on Submit

Determine whether two binary trees p and q are structurally identical and have the exact same node values at corresponding positions. Return true if they are identical, or false otherwise. Each tree has between 0 and 100 nodes with values between -10000 and 10000.

Example

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

Constraints

1 <= input.length <= 10⁵
Memory limit: 256 MB
Time limit: 2.0 seconds

solution.py

Input (stdin)