剑指offer. 27 二叉树的镜像
题目描述:
操作给定的二叉树,将其变换为源二叉树的镜像。
输入描述:
二叉树的镜像定义:源二叉树 8 / \ 6 10 / \ / \ 5 7 9 11 镜像二叉树 8 / \ 10 6 / \ / \ 11 9 7 5
解题思路:
//前序遍历这棵树的每个节点,如果遍历到的节点不为空,则交换左右节点。
代码:
递归
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if(pRoot==nullptr)
return ;
TreeNode *temp=pRoot->left;
pRoot->left=pRoot->right;
pRoot->right=temp;
Mirror(pRoot->left);
Mirror(pRoot->right);
}
};
迭代
/**
* 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:
TreeNode* mirrorTree(TreeNode* root) {
if (!root)
return nullptr;
stack<TreeNode*> stk{{root}};
TreeNode *cur = nullptr;
while (!stk.empty()){
cur = stk.top();
stk.pop();
TreeNode *tmp = cur->left;
cur->left = cur->right;
cur->right = tmp;
if (cur->right)
stk.push(cur->right);
if (cur->left)
stk.push(cur->left);
}
return root;
}
};