题解 | #二叉树的镜像#

import java.util.*;

public class Solution {

public TreeNode Mirror (TreeNode pRoot) {
    if(pRoot==null){
        return null;
    }
    if(pRoot.left!=null||pRoot.right!=null){
        TreeNode tmp=pRoot.left;
        pRoot.left=pRoot.right;
        pRoot.right=tmp;
    }else{
        return pRoot;
    }
    pRoot.left=Mirror(pRoot.left);
    pRoot.right=Mirror(pRoot.right);
    return pRoot;
}

}