码迷,mamicode.com
首页 > 其他好文 > 详细

Leetcode226:Invert Binary Tree

时间:2016-03-02 21:52:44      阅读:88      评论:0      收藏:0      [点我收藏+]

标签:

Invert a binary tree.

     4
   /     2     7
 / \   / 1   3 6   9

to

     4
   /     7     2
 / \   / 9   6 3   1
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
struct TreeNode* invertTree(struct TreeNode* root) 
{
    struct TreeNode *tmp;
    if(root == NULL)
    {
        return NULL;
    }
    tmp = root->left;
    root->left = invertTree(root->right);
    root->right = invertTree(tmp);
    return root;
    
}

 

Leetcode226:Invert Binary Tree

标签:

原文地址:http://www.cnblogs.com/evansyang/p/5236521.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!