0%

# invert-binary-tree

Posted on 2015-06-22 Edited on 2020-01-12 In leetcode Views: Disqus:

Invert a binary tree

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

to

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

Trivia:
This problem was inspired by this original tweet by Max Howell:

> Google: 90% of our engineers use the software you wrote (Homebrew),
> but you can’t invert a binary tree on a whiteboard so fuck off.

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    /**
     * 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 == NULL) return root;
            TreeNode* temp;
            temp = invertTree(root->left);
            root->left = invertTree(root->right);
            root->right = temp;
            return root;
        }
    };

Related Posts

- Reverse Integer
- 34_Search_for_a_Range
- leetcode no.3
- Number of 1 Bits
- Path Sum

请我喝杯咖啡

WeChat Pay

Alipay

- Post author: Nicksxs
- Post link: https://nicksxs.me/2015/06/22/invert-binary-tree/
- Copyright Notice: All articles in this blog are licensed under BY-NC-SA unless stating additionally.