算法 --- > 翻转二叉树

解(C++):
1.二叉树判空 if(root == 0) 或 if(root == nullptr);
2.二叉树的左子树: root->left .
3.使用递归,将当前根节点的左右指针指向互换左向右子树(此时右子树也进行了翻转)

// C++
/**
 * 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 == 0)
            return root;
        TreeNode* temp = root->left;
        root->left = invertTree(root->right);
        root->right = invertTree(temp);
        return root;
    }
};