Leetcode226:Invert Binary Tree

Posted

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode226:Invert Binary Tree相关的知识,希望对你有一定的参考价值。

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的主要内容,如果未能解决你的问题,请参考以下文章

Leetcode226:Invert Binary Tree

#Leetcode# 226. Invert Binary Tree

LeetCode 226. Invert Binary Tree

LeetCode226:Invert Binary Tree

Leetcode 226: Invert Binary Tree

LeetCode226. Invert Binary Tree 解题报告