剑指 Offer 27. 二叉树的镜像斜体样式
题目
代码
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef struct TreeNode{
int val;
struct TreeNode *left, *right;
}TreeNode, *BiTree;
void create(BiTree &root){
int tn;
cin>>tn;
if(tn == -1){
root = NULL;
return;
}
root = new TreeNode;
root->val = tn;
create(root->left);
create(root->right);
}
TreeNode* mirrorTree(TreeNode* root) {
if(!root){
return NULL;
}
TreeNode *left = mirrorTree(root->left);
TreeNode *right = mirrorTree(root->right);
root->left = right;
root->right = left;
return root;
}
int main(){
TreeNode *root, *res;
create(root);
res = mirrorTree(root);
return 0;
}