[leetcode]226. Invert Binary Tree

题目链接：https://leetcode.com/problems/invert-binary-tree/

Invert a binary tree.

/**
 * 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* left = invertTree(root->left);
        TreeNode* right = invertTree(root->right);
        root->left = right;
        root->right = left;
        return root;
    }
};

class Solution{
        public:
                TreeNode * invertTree(TreeNode * root)
                {
                        if(root==NULL)
                                return root;
                        if(root->left==NULL && root->right==NULL)
                                return root;
                        TreeNode * temp;
                        temp=root->left;
                        root->left=root->right;
                        root->right=temp;
                        root->left=invertTree(root->left);
                        root->right=invertTree(root->right);
                        return root;

                }
};