LeetCode226 翻转二叉树
前言
题目: 226. 翻转二叉树
文档: 代码随想录——翻转二叉树
编程语言: C++
解题状态: 递归的结束条件设置错误
思路
就是简单的递归一下,不过递归的结束条件要考虑清楚。
代码
/*** 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 invert(TreeNode* node) {if (node == NULL) return;TreeNode* cur = node -> left;node -> left = node -> right;node -> right = cur;invert(node -> left);invert(node -> right);}TreeNode* invertTree(TreeNode* root) {invert(root);return root;}
};