class Solution {
public:
bool isSymmetric(TreeNode *root) {
if(!root)return true;
return judge(root,root);
}
bool judge(TreeNode*r1,TreeNode*r2)
{
if(!r1&&!r2)return true;
if(!r1||!r2)return false;
if(r1->val!=r2->val)return false;
return judge(r1->left,r2->right)&&judge(r1->right,r2->left);
}
};
描述： Given a binary tree, check whether it is a mirror of ...
https://leetcode.com/problems/symmetric-tree/description/...
https://leetcode.com/problems/symmetric-tree/ My answer /...
https://leetcode.com/problems/symmetric-tree/ （来源： https:...
Problem https://leetcode.com/problems/symmetric-tree/ Giv...
题目： https://leetcode.com/problems/symmetric-tree/ 分析： Inp...
题目描述 https://leetcode-cn.com/problems/symmetric-tree/ 思路 ...
题目 https://leetcode-cn.com/problems/symmetric-tree/submis...
链接: https://leetcode.com/problems/symmetric-tree/原题: 分析:这...
本文标题：symmetric-tree
本文链接：https://www.haomeiwen.com/subject/jgyznqtx.html
网友评论