226. Invert Binary Tree

[이벤트(1.226)]

class Solution {

public void invert(TreeNode root) {

if(root == null) return;

TreeNode tmp = root.left;

root.left = root.right;

root.right = tmp;

invert(root.left);

invert(root.right);

}

public TreeNode invertTree(TreeNode root) {

invert(root);

return root;

}

}