LeetCode——Invert Binary Tree
来源:互联网 发布:手机淘宝 占用空间 编辑:程序博客网 时间:2024/06/08 13:58
题目:
Invert a binary tree.
4 / \ 2 7 / \ / \1 3 6 9
to
4 / \ 7 2 / \ / \9 6 3 1
解答:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* invertTree(TreeNode* root) { if (root == NULL) { return root; } TreeNode* tmp = root->right; root->right = root->left; root->left = tmp; invertTree(root->right); invertTree(root->left); return root; }};
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
- 2015061209 - 如何读书
- Ubuntu 12.10下安装ibus中文输入法
- 利用SqlCommand和SqlDataReader对象操作数据库
- Zookeeper学习1---zk配置
- 2015061210 - js非空校验
- LeetCode——Invert Binary Tree
- asp.net查询数据显示等待中提示效果
- Oracle单实例情况下的library cache pin的问题模拟与问题分析
- Java 实现链表
- 跳转页面等待加载情况的解决
- STL容器之map/multimap
- 关于Dreamweaver cs6官方版本破解方法—附破解文件
- Android 学习 5 ->用代码布局和xml布局
- Servlet相关常用类