leetcode 226. Invert Binary Tree
2018-09-17 15:40
423 查看
class Solution { public: TreeNode* invertTree(TreeNode* root) { if(root == NULL) return NULL; TreeNode* tmp = invertTree(root->left); root->left = invertTree(root->right); root->right = tmp; return root; } };
相关文章推荐
- leetcode 226. Invert Binary Tree 题解
- Leetcode 226 Invert Binary Tree
- leetcode_c++:树: Invert Binary Tree(226 )
- LeetCode 226----Invert Binary Tree
- LeetCode-226 Invert Binary Tree
- LeetCode 226. Invert Binary Tree
- [LeetCode]226. Invert Binary Tree
- [LeetCode 226] Invert Binary Tree
- LeetCode-226. Invert Binary Tree
- Leetcode 226. Invert Binary Tree (Easy) (cpp)
- LeetCode226:Invert Binary Tree
- [LeetCode]--226. Invert Binary Tree
- [leetcode]226. Invert Binary Tree
- leetcode 226. Invert Binary Tree
- Leetcode:226. Invert Binary Tree
- Leetcode题解 226. Invert Binary Tree
- LeetCode #226 - Invert Binary Tree - Easy
- leetcode 226. Invert Binary Tree
- [leetcode] 226. Invert Binary Tree 解题报告
- LeetCode 226. Invert Binary Tree