226. Invert Binary Tree [LeetCode]

Invert a binary tree.反转二叉树

Example:

Input:

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

Output:

     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.

 

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

typedef struct TreeNode TreeNode;
static void swap(TreeNode **left, TreeNode **right) {
    TreeNode *tmp = *left;
    *left = *right;
    *right= tmp;
}

TreeNode *invertTree(TreeNode *root){
    if (NULL ==root) return NULL;
    invertTree(root->left);
    invertTree(root->right);
    swap(&root->left, &root->right);
    return root;
}