226. Invert Binary Tree (Tree)

easy

 

 

class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root == null) return root;
        TreeNode newRoot = new TreeNode(0);
        newRoot = invertTree(root.left);
        root.left = invertTree(root.right);
        root.right = newRoot;
        return root;
        
    }
}