Learn and practice the Tree Depth-First Search and Tree Breadth-First Search patterns to solve coding interview problems.

Speedrun the LinkedIn Coding Interview: Top Problems in Java

Trees play a pivotal role in organizing hierarchical data, optimizing searches, and solving complex problems. In this module, we’ll learn to choose the appropriate tree for a given problem and apply the more appropriate of the two major traversal techniques, breadth-first or depth-first, to solve it.

Trees

# Statement

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

**Constraints:**

- The number of nodes in the tree is in the range $[0, 100]$

- $-10^4 \leq$ `node.data` $\leq 10^4$

# Examples

Same Tree

Statement