题目链接:https://leetcode-cn.com/problems/invert-binary-tree/
题目如下:
思路:用先序遍历来写,对着图来写。
/**
* 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 {
public:
TreeNode* invertTree(TreeNode* root) {
preorder(root);
return root;
}
void preorder(TreeNode* root){
if(root==NULL) return ;
swap(root->left,root->right);
preorder(root->left);
preorder(root->right);
}
};