leetcode 226 翻转二叉树（递归）

https://leetcode-cn.com/problems/invert-binary-tree/

很典型的一个递归，翻转嘛，就是把每一个节点的左右子树翻转一下就做到了整棵树的翻转
代码

/**
 * 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:
    void work(TreeNode* rt) {
        if (rt -> left) {
            work(rt -> left);
        }
        if (rt -> right) {
            work(rt -> right);
        }
        TreeNode* t = rt -> left;
        rt -> left = rt -> right;
        rt -> right = t;
        return ;
    }
    TreeNode* invertTree(TreeNode* root) {
        if (!root) return root;
        work(root);
        return root;
    }
};