226. 翻转二叉树
方法:递归
/**
* 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) {
// 确定终止条件
if(root == nullptr){
return nullptr;
}
// 确定本层的逻辑:本层节点要干什么,孩子节点要干什么
TreeNode *leftInvertRes = invertTree(root->left);
TreeNode *rightInvertRes = invertTree(root->right);
root->left = rightInvertRes;
root->right = leftInvertRes;
return root;
}
};