Invert Binary Tree
来源:互联网 发布:2017淘宝销量排行榜 编辑:程序博客网 时间:2024/06/05 22:39
Invert a binary tree.
4 / \ 2 7 / \ / \1 3 6 9to
4 / \ 7 2 / \ / \9 6 3 1
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public TreeNode invertTree(TreeNode root) { if(root == null){ return null; } TreeNode left = root.left; TreeNode right = root.right; root.left = invertTree(right); root.right = invertTree(left); return root; }}
0 0
- [leetcode] Invert Binary Tree
- [LeetCode]Invert Binary Tree
- Invert Binary Tree
- leetcode:Invert Binary Tree
- Invert Binary Tree
- LeetCode Invert Binary Tree
- 226Invert Binary Tree
- LeetCode | Invert Binary Tree
- leetcode--Invert Binary Tree
- [leetcode] Invert Binary Tree
- [LeetCode] Invert Binary Tree
- LeetCode Invert Binary Tree
- Invert Binary Tree
- leetcode : Invert Binary Tree
- 226Invert Binary Tree
- Invert Binary Tree
- [LeetCode] Invert Binary Tree
- [Leetcode]Invert Binary Tree
- PackageManager hasSystemFeature
- leetcode 53: Spiral Matrix
- 《C++编程思想》第六章 输入输出流介绍(原书代码+习题+解答)
- POJ 1573 Robot Motion
- mysql远程无法登陆解决办法
- Invert Binary Tree
- [BZOJ1622] [Usaco2008 Open]Word Power 名字的能量
- HDU-1896-Stones
- 项目笔记用到的链接
- LeetCode题解——Swap Nodes in Pairs
- chrome 支付宝控件安装
- getopt()
- 数据结构和算法学习笔记-1
- 蚂蚁的难题(三)