# Invert Binary Tree

Try to solve the Invert Binary Tree problem.

## We'll cover the following

## Statement

Given the root node of a binary tree, transform the tree by swapping each nodeâ€™s left and right subtrees, thus creating a mirror image of the original tree. Return the root of the transformed tree.

**Constraints:**

- $0\leq$ Number of nodes in the tree $\leq 100$
- $-1000 \leq$
`Node.value`

$\leq 1000$

## Examples

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy