Invert Binary Tree, is a LeetCode problem. In this post we will see how we can solve this challenge in Python

Problem Description

Invert a binary tree. 4 / 2 7 / \ / 1 3 6 9

to 4 / 7 2 / \ / 9 6 3 1

Trivia: This problem was inspired by this original tweet by Max Howell: Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off. ....

You can find the full details of the problem Invert Binary Tree at LeetCode

Solution: Please check the main.py snippet for the solution.

This solution originally posted at: Github by @kamyu104