leetcode 101镜像二叉树

题目：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

1

/
2 2
/ \ /
3 4 4 3
But the following [1,2,2,null,3,null,3] is not:
1
/
2 2
\
3 3
Note:
Bonus points if you could solve it both recursively and iteratively.
题解：
q=[root]
while any(q):
values=[i.val if i else None for i in q]
if values!=values[::-1]:return False
q=[child for i in q if i for child in [i.left,i.right]]
return True