226翻转二叉树

判断是否已经是NULL，不是则将左右互换，再递归
/**

• 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:

TreeNode* changetree(TreeNoderoot)
{
TreeNode node=root->left;

    root->left=root->right;
    root->right=node;
    return root;

}
TreeNode* invertTree(TreeNode* root)
{
if(root==NULL)return NULL;
else
{
root=changetree(root);
root->left=invertTree(root->left);
root->right=invertTree(root->right);

    }
     return root;
}

};