/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null){
return null;
}
TreeNode newNode = new TreeNode(root.val);
newNode.left = invertTree(root.right);
newNode.right = invertTree(root.left);
return newNode;
}
}