渣渣写LEETCODE——226. Invert Binary Tree

Problem:

Invert a binary tree.

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

to

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

Solution:

递归求解，交换指针。

有更好的解法再补充。

Code:

/*__xz__*/class Solution {public:    TreeNode* invertTree(TreeNode* root) {        TreeNode* temp;        if (root != NULL) {        temp = root->left;        root->left = root->right;        root->right = temp;        root->left = invertTree(root->left);        root->right = invertTree(root->right);        } else return NULL;    }};