请设计一个函数判断一棵二叉树是否 轴对称 。
示例 1:
输入:root = [6,7,7,8,9,9,8] 输出:true 解释:从图中可看出树是轴对称的。
示例 2:
输入:root = [1,2,2,null,3,null,3] 输出:false 解释:从图中可看出最后一层的节点不对称。
/**
* 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 m_bequal=true;
TreeNode* mirrorTree(TreeNode* root)
{
if(root==nullptr)
return nullptr;
else
{
TreeNode* temp = root->left;
root->left = root->right;
root->right = temp;
root->left= mirrorTree(root->left);
root->right =mirrorTree(root->right);
return root;
}
}
void node_equal(TreeNode* left,TreeNode* right)
{
if(left==nullptr && right!=nullptr)
m_bequal =false;
if(left!=nullptr && right==nullptr)
m_bequal = false;
if(left!=nullptr && right!=nullptr)
{
if(left->val!=right->val)
m_bequal =false;
if(m_bequal)
{
node_equal(left->left,right->left);
node_equal(left->right,right->right);
}
}
}
bool checkSymmetricTree(TreeNode* root) {
if(root==nullptr)
return true;
root->left=mirrorTree(root->left);
node_equal(root->left,root->right);
return m_bequal;
}
};