剑指offer刷题--GZ18--二叉树的镜像

解题思路：交换左右子树的节点，而后递归调用该方法。java /** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */ public class Solution {

>>阅读原文<<