Leetcode Problem 226. Invert Binary Tree

226. Invert Binary Tree

Leetcode Solutions

Check if the current node is null. If it is, return null since there is nothing to invert.
Recursively call invertTree on the right child of the current node.
Recursively call invertTree on the left child of the current node.
Swap the left and right children of the current node.
Return the current node as the new root of the inverted subtree.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen