翻转一棵二叉树

佚名 6年前 (2019-04-22) 随笔 2052人围观抢沙发百度已收录

递归

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     TreeNode* invertTree(TreeNode* root) {
13         if(root == NULL)
14             return root;
15         
16         TreeNode* temp = root->left;
17         root->left = invertTree(root->right);
18         root->right = invertTree(temp);
19         //delete temp;
20         return root;
21     }
22 };