AcWing 38. 二叉树的镜像
原题链接
简单
作者:
daniellee
,
2019-04-10 20:56:32
,
所有人可见
,
阅读 1026
C++ 代码
/**
* 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:
void flip(TreeNode* root){
TreeNode* l = root->left;
TreeNode* r = root->right;
root->left = r;
root->right = l;
}
void dfs(TreeNode* root){
if(root!=NULL){
dfs(root->left);
dfs(root->right);
flip(root);
}
}
void mirror(TreeNode* root) {
if (root ==NULL) return;
dfs(root);
return;
}
};