public://递归实现TreeNode*invertTree(TreeNode* root) {if(!root)returnroot; TreeNode *tmp = root->left; root->left =invertTree(root->right); root->right =invertTree(tmp);returnroot; }//非递归实现TreeNode*invertTree2(TreeNode* root) {if(root == NULL)returnroot; queue<TreeNode*> t...
1TreeNode* invertTree(TreeNode*root) {2if(root ==nullptr)3returnnullptr;45std::stack<TreeNode*>nodes;6nodes.push(root);78while(!nodes.empty()) {9TreeNode *pNode =nodes.top();10nodes.pop();1112TreeNode *tmp = pNode->left;13pNode->left = pNode->right;14pNode->right =tmp;1516i...