101. 对称二叉树
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
/// 进行一个对称的层序遍历
bool isSymmetric(TreeNode* root) {
queue<TreeNode*> q;
/// 首先将根节点入队两次,在后续的遍历中每次取出两个节点
q.push(root);
q