Invert Binary Tree

Invert Binary Tree Add to List
Description Submission Solutions
Total Accepted: 154920
Total Submissions: 307555
Difficulty: Easy
Contributors: Admin
Invert a binary tree.

 4

/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1

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