Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
48 lines (44 loc) · 1.02 KB

File metadata and controls

48 lines (44 loc) · 1.02 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
package offer;
import leetcode.common.TreeNode;
import leetcode.common.TreeUtils;
/**
* 二叉树的镜像
*
* 操作给定的二叉树,将其变换为源二叉树的镜像。
* 输入描述:
* 二叉树的镜像定义:源二叉树
* 8
* / \
* 6 10
* / \ / \
* 5 7 9 11
*
* 镜像二叉树
* 8
* / \
* 10 6
* / \ / \
* 11 9 7 5
*
*
* @author 刘壮飞
* https://github.com/zfman.
* https://blog.csdn.net/lzhuangfei.
*/
public class MirrorSolution {
public void Mirror(TreeNode root) {
if(root!=null){
TreeNode tmp=root.left;
root.left=root.right;
root.right=tmp;
Mirror(root.left);
Mirror(root.right);
}
}
public static void main(String[] args){
String str="8,6,5,#,#,7,#,#,10,9,#,#,11,#,#";
TreeNode root=TreeUtils.stringToTreeWith(str,",");
new MirrorSolution().Mirror(root);
TreeUtils.travser(root);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.