leetcode：Invert Binary Tree
来源：互联网 发布：exchange邮箱域名 编辑：程序博客网 时间：2024/06/11 09:38
Invert a binary tree.
4/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1
Trivia:
This problem was inspired by this original tweet by Max Howell:
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.
其实只要利用递归的做法来做就可以很好的做出来了
/** * 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) { invert(root); return root; } void invert(TreeNode node){ if(node != null){ TreeNode t = node.left; node.left = node.right; node.right = t; invert(node.left); invert(node.right); } }} 0 0
- [leetcode] Invert Binary Tree
- [LeetCode]Invert Binary Tree
- leetcode：Invert Binary Tree
- LeetCode Invert Binary Tree
- LeetCode | Invert Binary Tree
- leetcode--Invert Binary Tree
- [leetcode] Invert Binary Tree
- [LeetCode] Invert Binary Tree
- LeetCode Invert Binary Tree
- leetcode : Invert Binary Tree
- [LeetCode] Invert Binary Tree
- [Leetcode]Invert Binary Tree
- LeetCode: Invert Binary Tree
- LeetCode Invert Binary Tree
- leetcode: Invert Binary Tree
- LeetCode Invert Binary Tree
- LeetCode || Invert Binary Tree
- LeetCode:Invert Binary Tree
- S是一个存放在数组中，长为n的字符串，试编写一个程序将S按下述要求改造后输出
- 常用的三种android分包规范
- Android 音量调节方法
- Android—Activity的四种启动模式
- 将栈S中的元素逆置，使用额外的一个栈L和非数组变量
- leetcode：Invert Binary Tree
- 已知s="(XYZ)+*",t="(X+Z)*Y",利用联接，求子串和转换等基本运算，将s转化为t
- leetcode[226]:Invert Binary Tree
- Populating Next Right Pointers in Each Node II
- Qt4学习(3)——用定时器循环播放图片
- linux命令10--file
- 使用Apache的ab工具进行压力测试
- alsa和oss声音系统比较
- uva580(数学题)
