LeetCode-101.对称二叉树

bool bfs(struct TreeNode* LNode,struct TreeNode* RNode)
{
    bool ret;
    
    if(LNode==NULL&&RNode==0) 
        return true;
    if(LNode!=0&&RNode!=0)
    {
        if(LNode->val!=RNode->val)
            return false;
   
        ret=bfs(LNode->left,RNode->right)&&bfs(LNode->right,RNode->left);
        return ret;    
    }
    else
     return false;
}


bool isSymmetric(struct TreeNode* root) {  
  if(!root)
        return true ;
    
   else
    return (bfs(root->left,root->right));
}

---

文章来源：https://www.cnblogs.com/lifexy/p/8674383.html