Invert Binary Tree

Try to solve the Invert Binary Tree problem.

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≤0\leq Number of nodes in the tree ≤100\leq 100
  • −1000≤-1000 \leq Node.value ≤1000\leq 1000

Examples

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

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