剑指OFFER27
本题的解题思路是逐层递归,遇到非空节点则添加,每次调用swap函数调整左右节点
/**
* 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:
TreeNode* mirrorTree(TreeNode* root) {
if(root==NULL) return root;
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
int len = q.size();
for(int i=0;i<len;i++){
TreeNode* cur = q.front();
q.pop();
swap(cur->left,cur->right);
if(cur->left) q.push(cur->left);
if(cur->right) q.push(cur->right);
}
}
return root;
}
};