Leetcode Problem 156. Binary Tree Upside Down

156. Binary Tree Upside Down

Leetcode Solutions

Recursive Approach

  1. Check if the current node is null or if it is a leaf node (i.e., both left and right children are null). If so, return the current node as it is the new root.
  2. Recursively call the function on the left child to continue the process down the tree.
  3. Once the recursion unwinds, set the current node's left child's left to the current node's right child.
  4. Set the current node's left child's right to the current node itself.
  5. Set the current node's left and right children to null to break the original tree structure.
  6. Return the new root obtained from the recursion.
UML Thumbnail

Iterative Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...