226. 翻转二叉树
#leetcode#树#dfs 2025-01-27 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
//! 递归方法 log(n)~n,n
class Solution {
 public:
  TreeNode *invertTree(TreeNode *root) {
    dfsModify(root);
    return root;
  }
  void dfsModify(TreeNode *node) {
    if (node == nullptr) {
      return;
    }
    dfsModify(node->left);
    dfsModify(node->right);

    TreeNode *temp = node->left;
    node->left = node->right;
    node->right = temp;
    return;
  }
};