剑指Offer17 二叉树的镜像

 /*************************************************************************
     > File Name: 17_MirrorOfBinaryTree.cpp
     > Author: Juntaran
     > Mail: JuntaranMail@gmail.com
     > Created Time: 2016年08月30日 星期二 17时10分03秒
  ************************************************************************/

 #include <stdio.h>
 #include <stdlib.h>
 #include <malloc.h>
 #include <bits/stdc++.h>

 using namespace std;

 // 二叉树结构体
 struct TreeNode
 {
     int val;
     TreeNode* left;
     TreeNode* right;
 };

 TreeNode* createTree()
 {
     TreeNode* root = (TreeNode*)malloc(sizeof(TreeNode));
     root->val = ;
     root->left = (TreeNode*)malloc(sizeof(TreeNode));
     root->left->val = ;
     root->right = (TreeNode*)malloc(sizeof(TreeNode));
     root->right->val = ;
     root->right->left = NULL;
     root->right->right = NULL;
     root->left->left = (TreeNode*)malloc(sizeof(TreeNode));
     root->left->left->val = ;
     root->left->left->left = NULL;
     root->left->left->right = NULL;
     root->left->right = (TreeNode*)malloc(sizeof(TreeNode));
     root->left->right->val = ;
     root->left->right->left = (TreeNode*)malloc(sizeof(TreeNode));
     root->left->right->left->val = ;
     root->left->right->left->left = NULL;
     root->left->right->left->right = NULL;
     root->left->right->right = (TreeNode*)malloc(sizeof(TreeNode));
     root->left->right->right->val = ;
     root->left->right->right->left = NULL;
     root->left->right->right->right = NULL;

     return root;
 }

 void Mirror(TreeNode* root)
 {
     if (root == NULL)
         return;
     if (root->left==NULL && root->right==NULL)
         return;

     TreeNode* temp = root->left;
     root->left = root->right;
     root->right = temp;

     if (root->left)
         Mirror(root->left);
     if (root->right)
         Mirror(root->right);
 }

 // 层序遍历二叉树
 void PrintTreeByLevel(TreeNode* root)
 {
     if (root == NULL)
         return;

     vector<TreeNode*> vec;
     vec.push_back(root);
     int cur = ;
     int last = ;

     while (cur < vec.size())
     {
         last = vec.size();
         while (cur < last)
         {
             printf("%d ", vec[cur]->val);
             if (vec[cur]->left != NULL)
                 vec.push_back(vec[cur]->left);
             if (vec[cur]->right != NULL)
                 vec.push_back(vec[cur]->right);

             ++ cur;
         }
         printf("\n");
     }
 }

 int main()
 {
     TreeNode* tree = createTree();

     PrintTreeByLevel(tree);
     printf("\n");

     Mirror(tree);
     PrintTreeByLevel(tree);

     return ;
 }