leetcode 226 Invert Binary Tree

Posted GadyPu

tags:

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

题目连接

https://leetcode.com/problems/invert-binary-tree/ 

Invert Binary Tree

Description

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;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if(!root) return nullptr;
        function<void(TreeNode*)> dfs = [&](TreeNode *root) {
            if(!root) return;
            swap(root->left, root->right);
            dfs(root->left);
            dfs(root->right);
        };
        dfs(root);
        return root;
    }
};

以上是关于leetcode 226 Invert Binary Tree的主要内容,如果未能解决你的问题,请参考以下文章

leetcode 226 Invert Binary Tree

#Leetcode# 226. Invert Binary Tree

LeetCode 226. Invert Binary Tree

LeetCode226:Invert Binary Tree

Python解Leetcode: 226. Invert Binary Tree

Leetcode 226: Invert Binary Tree