题目:
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { public TreeNode mirrorTree(TreeNode root) { if(root==null){ //递归边界,当越过叶节点时递归结束 return null; } TreeNode temp=root.left; //暂存root的左子节点 root.left=mirrorTree(root.right); //进入递归 修改节点 root.right=mirrorTree(temp); return root; } }
原文:https://www.cnblogs.com/Yunus-ustb/p/12940404.html