二叉树镜像（python、BFS)
二叉树的镜像
http://www.nowcoder.com/questionTerminal/564f4c26aa584921bc75623e48ca3011
class Solution:
# 返回镜像树的根节点, BFS做法
def Mirror(self, root):
# write code here
nodeQueue = [root]
while nodeQueue:
curNode = nodeQueue.pop(0)
if not curNode:
return None
if curNode.left:
nodeQueue.append(curNode.left)
if curNode.right:
nodeQueue.append(curNode.right)
curNode.left, curNode.right = curNode.right, curNode.left
