一、翻转一颗二叉树 递归实现 TreeNode * invertTree(TreeNode *root) { if(!root) return NULL; TreeNode *tmp = root->left; root->left = invertTree(root->right); root->right = invertTree(root->left); return root; }