来自:leecode
//层次遍历用队列
TreeNode* invertTree(TreeNode* root) {
if(root==nullptr) return nullptr;
deque<TreeNode*> dequeA;
dequeA.push_back(root);
while(!dequeA.empty()){
TreeNode* cur=dequeA.front();
dequeA.pop_front();
TreeNode* temp=cur->left;
cur->left=cur->right;
cur->right=temp;
if(cur->left!=nullptr) dequeA.push_back(cur->left);
if(cur->right!=nullptr) dequeA.push_back(cur->right);
}
return root;
}