TreeNode* mirrorTree(TreeNode* root) {
if(!root) return root;
TreeNode* tmp = root->left;
root->left = root->right;
root->right = tmp;
mirrorTree(root->left);
mirrorTree(root->right);
return root;
}
// 迭代
// 栈
TreeNode* mirrorTree(TreeNode* root) {
stack<TreeNode*> sck;
sck.push(root);
while(!sck.empty())
{
TreeNode* tmp = sck.top();
sck.pop();
if(!tmp) continue;
swap(tmp->left,tmp->right);
if(tmp->right != NULL) sck.push(tmp->right);
if(tmp->left != NULL) sck.push(tmp->left);
}
return root;
}
// 队列
TreeNode* mirrorTree(TreeNode* root) {
queue<TreeNode*> que;
que.push(root);
while(!que.empty())
{
TreeNode* tmp = que.front();
que.pop();
if(tmp == NULL) continue;
swap(tmp->left,tmp->right);
if(tmp->left) que.push(tmp->left);
if(tmp->right) que.push(tmp->right);
}
return root;
}
镜像树xxx
最新推荐文章于 2024-03-11 11:08:02 发布