Invert Binary Tree My Submissions QuestionEditorial Solution
Total Accepted: 87818 Total Submissions: 193396 Difficulty: Easy
Invert a binary tree.

4
/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1
逆轉一顆二叉樹
思路：so easy

/*** 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 *tnode;tnode = root->left;root->left = root->right;root->right = tnode;invertTree(root->left);invertTree(root->right);return root;} };

轉載于:https://www.cnblogs.com/freeopen/p/5482932.html

總結

以上是生活随笔為你收集整理的37-Invert Binary Tree的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。