Grokking the Coding Interview Patterns in C++/

...

/

Solution: Invert Binary Tree

Solution: Invert Binary Tree

Let's solve the Invert Binary Tree problem using the Tree Depth-first Search pattern.

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≤0\leq Number of nodes in the tree ≤100\leq 100
...
Access this course and 1400+ top-rated courses and projects.