leetcode:Inver Binary Tree

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: a TreeNode, the root of the binary tree
     * @return: nothing
     */
    public void invertBinaryTree(TreeNode root) {
        //是否停止
        if (root == null) {
            return;
        }
        //同棵树的左右值互相对换
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;
        //左右再次遍历，逐一遍历下去
        invertBinaryTree(root.left);
        invertBinaryTree(root.right);
 
    }
}