题目:
Invert a 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:
void swap(TreeNode* &left, TreeNode* &right){
TreeNode* temp = left;
left = right;
right = temp;
}
void preOrder(TreeNode* &root)
{
if(root != nullptr){
swap(root->left, root->right);
preOrder(root->left);
preOrder(root->right);
}
}
TreeNode* invertTree(TreeNode* root) {
preOrder(root);
return root;
}
};