Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

easy· trees Mock interview

Same Tree

Given the roots of two binary trees `p` and `q`, return true if they are structurally identical and every corresponding node has the same value.

Examples

in: p = [1,2,3], q = [1,2,3]

out: true

identical

in: p = [1,2], q = [1,null,2]

out: false

different shape

Constraints

0 <= number of nodes <= 100
-10^4 <= node value <= 10^4

Hints

target: O(n) time⌘↩ run · ⇧⌘↩ submit