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 root of a binary tree, check whether it is a symmetric tree.
A symmetric tree refers to a tree that is a mirror of itself, i.e., symmetric around its root.

**Constraints:**

- The tree contains nodes in the range $[1, 500]$.
- $-10^3 \le$ `Node.data` $\le 10^3$

# Examples


Symmetric Tree

Statement