LeetCode(47) Invert Binary Tree
来源:互联网 发布:复杂网络及其应用pdf 编辑:程序博客网 时间:2024/06/05 11:08
题目描述
Invert a binary tree.
=>
题目要求将二叉树的左右子树进行逆转。
解题思路
根据题目的要求可以进行一层一层的逆转,也就是交换结点的左右子树。将未处理的元素放入栈中,本题的关键在于对于元素的入栈顺序进行控制。
/** * 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 NULL; TreeNode* head = root; stack<TreeNode*> nodes; nodes.push(head); while(!nodes.empty()) { TreeNode* r = nodes.top(); nodes.pop(); swap(r->left, r->right); if(r->left != NULL) nodes.push(r->left); if(r->right != NULL) nodes.push(r->right); } return root; }};
0 0
- LeetCode(47) 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
- Android:资源 id 及资源 id 的动态获取
- RTCP
- IOS9_微信SDK
- perl 5基础教程——运算符
- ListView中控件点击事件与Item点击事件冲突的问题
- LeetCode(47) Invert Binary Tree
- AjaxFileUpload实现文件异步上传
- 10 - 文件和异常处理
- 第十四章:网络编程
- IEEE754标准
- java socket 属性设置
- 鸟哥的Linux私房菜10.10 主机规划
- Xcode无法调试APP
- 计算机网络之远程终端协议TELNET