June 24, 2022 · 1 min read
https://leetcode.com/problems/invert-binary-tree/
class Solution {
void swapNode(TreeNode *root) {
if (root == nullptr) {
return;
}
swapNode(root->left);
swapNode(root->right);
TreeNode *temp = root->left;
root->left = root->right;
root->right = temp;
}
public:
TreeNode *invertTree(TreeNode *root) {
swapNode(root);
return root;
}
};