leetcode/src/s0226_invert_binary_tree.cpp

#include "s0226_invert_binary_tree.hpp"

TreeNode *S0226::invertTree(TreeNode *root) {
  if (root == nullptr) return nullptr;
  TreeNode *tmp = root->left;
  root->left = invertTree(root->right);
  root->right = invertTree(tmp);
  return root;
}