Leetcode: Invert Binary Tree

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 == nullptr 
            || root->left == nullptr && root->right == nullptr) {
            return root;
        }
        
        TreeNode* newRight = invertTree(root->left);
        root->left = invertTree(root->right);
        root->right = newRight;
        
        return root;
    }
};