题解 | #二叉树的镜像#

先序遍历的运用

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pRoot TreeNode类 
     * @return TreeNode类
     */
    public TreeNode Mirror (TreeNode pRoot) {
        // write code here
        preorder(pRoot);
        return pRoot;
    }
    public void preorder(TreeNode node){
        if(node != null){
            TreeNode tmp = node.left;
            node.left = node.right;
            node.right = tmp;
            preorder(node.left);
            preorder(node.right);
        }
        
    }
}