(21) 转换二叉树，使之镜像对称

一、问题描述

给定一个二叉树，转换二叉树，使之与原来的二叉树镜像对称

 

二、Code

 1 package algorithm;
 2 
 3 /**
 4  * Created by adrian.wu on 2019/5/29.
 5  */
 6 public class MirrowRecursive {
 7     public static class TreeNode {
 8         TreeNode left;
 9         TreeNode right;
10         int val;
11 
12         public TreeNode(int val) {
13             this.val = val;
14         }
15     }
16 
17     public static void mirrowRecursive(TreeNode head) {
18         if (head == null) return;
19         if (head.left == null && head.right == null) return;
20 
21         TreeNode leftTemp = head.left;
22         head.left = head.right;
23         head.right = leftTemp;
24 
25         if (head.left != null) mirrowRecursive(head.left);
26         if (head.right != null) mirrowRecursive(head.right);
27     }
28 }

 

转载于:https://www.cnblogs.com/ylxn/p/10949119.html