LeetCode:Invert Binary Tree

标签：

     4
   /     2     7
 / \   / 1   3 6   9

     4
   /     7     2
 / \   / 9   6 3   1

c++ code:

/**
 * 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* invertTree(TreeNode* root) {
        if(NULL == root) return NULL;
        //if(root->left != NULL && root->right != NULL)
        //{
            root->left = invertTree(root->left);
            root->right = invertTree(root->right);
            TreeNode *t = root->left;
            root->left = root->right;
            root->right = t;
       // }
        return root;
    }
};

LeetCode:Invert Binary Tree

标签：

原文地址：http://blog.csdn.net/itismelzp/article/details/51331437