/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if(pRoot==NULL){
return;
}
//将根节点的左右子树交换
TreeNode* newRoot=pRoot->left;
pRoot->left=pRoot->right;
pRoot->right=newRoot;
//采用递归
Mirror(pRoot->left);
Mirror(pRoot->right);
}
};
【牛客】18、二叉树的镜像
最新推荐文章于 2024-04-10 23:38:06 发布