java solution 0ms


  • 0
    E
    public class Solution {
        public TreeNode invertTree(TreeNode root) {
            if (root == null) return null;
            TreeNode tree = root.left;
            root.left = root.right;
            root.right = tree;
            invertTree(root.left);
            invertTree(root.right);
            return root;
        }
    }

Log in to reply
 

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