code:
递归
前序遍历:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
private:
void traversal(TreeNode*root)
{
if(root==NULL)return;
swap(root->left,root->right);
traversal(root->left);
traversal(root->right);
return;
}
public:
TreeNode* invertTree(TreeNode* root) {
traversal(root);
return root;
}
};
中序遍历:
class Solution {
private:
void traversal(TreeNode*root)
{
if(root==NULL)return;
traversal(root->left);
swap(root->left,root->right);
traversal(root->left);
return;
}
public:
TreeNode* invertTree(TreeNode* root) {
traversal(root);
return root;
}
};
后序遍历:
class Solution {
private:
void traversal(TreeNode*root)
{
if(root==NULL)return;
traversal(root->left);
traversal(root->right);
swap(root->left,root->right);
return;
}
public:
TreeNode* invertTree(TreeNode* root) {
traversal(root);
return root;
}
};