递归class Solution { public: TreeNode* invertTree(TreeNode* root) { if(rootnullptr){ return root; } TreeNode* leftinvertTree(root-left); TreeNode* rightinvertTree(root-right); root-leftright; root-rightleft; return root; } };