LeetCode226:Invert Binary Tree 二叉树反转

题目

226. Invert Binary Tree

QuestionEditorial Solution

 My Submissions

• Total Accepted: 109341

• Total Submissions: 230799

• Difficulty: Easy

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.

/**
 * 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) {
        TreeNode *p,*q;
        p = NULL;
        q = NULL;
        if (root != NULL)
        {
            p = root->left;
            q = root->right;
            root->left = q;
            root->right = p;
            invertTree(root->left);
            invertTree(root->right);
        }
        return  root;
    }
};

本文转自313119992 51CTO博客，原文链接:http://blog.51cto.com/qiaopeng688/1834271