Invert a binary tree.
4 / \ 2 7 / \ / \ 1 3 6 9to
4 / \ 7 2 / \ / \ 9 6 3 1
思路:深度优先或是广度优先都可以的吧
代码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;
}
if(root->left==NULL && root->right==NULL) {
return root;
}
else{
TreeNode* temp;
temp=invertTree(root->left);
temp=invertTree(root->right);
std::swap(root->left, root->right);
}
return root;
}
};
代码2:
/**
* 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;}
root->left=invertTree(root->left);
root->right=invertTree(root->right);
TreeNode* temp=root->left;
root->left=root->right;
root->right=temp;
return root;
}
};