Easy recursive solution, why you didn't figure it out Max?


  • 1
    P
    public class Solution {
        public TreeNode invertTree(TreeNode root) {
            if(root != null) {
                TreeNode temp = root.left;
                root.left = root.right;
                root.right = temp;
                invertTree(root.left);
                invertTree(root.right);
                return root;
            } 
            return null;
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.