题目描述
操作给定的二叉树,将其变换为源二叉树的镜像
题目地址
https://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&tqId=11171&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
思路
- 前序遍历,每次交换节点的左右子树;即必须先交换节点的左右子树后,才能继续遍历
Code
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if (pRoot == nullptr) return;
auto tmp = pRoot->left;
pRoot->left = pRoot->right;
pRoot->right = tmp;
Mirror(pRoot->left);
Mirror(pRoot->right);
}
};