#226. Invert Binary Tree
递归反转,申明一个temp结点
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void tranverse(TreeNode*&root)
{
if(root==nullptr)
return;
TreeNode*temp=root->left;
root->left=root->right;
root->right=temp;
tranverse(root->left);
tranverse(root->right);
}
TreeNode* invertTree(TreeNode* root) {
if (root==nullptr)
return nullptr;
tranverse(root);
return root;
}
};
来储存。