Invert Binary Tree

11
/\/\
23=>32
/\
44

/**
*DefinitionofTreeNode:
*publicclassTreeNode{
*publicintval;
*publicTreeNodeleft,right;
*publicTreeNode(intval){
*this.val=val;
*this.left=this.right=null;
*}
*}
*/
publicclassSolution{
/**
*@paramroot:aTreeNode,therootofthebinarytree
*@return:nothing
*/
publicvoidinvertBinaryTree(TreeNoderoot){
//writeyourcodehere
if(root==null)return;

TreeNodeleft=root.left;
root.left=root.right;
root.right=left;

invertBinaryTree(root.left);
invertBinaryTree(root.right);
}
}