Symmetric Tree

原创于 2014-12-10 16:16:58 发布 · 520 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种检查二叉树是否为中心对称的方法，提供了递归算法实现，并通过示例展示了如何判断一棵二叉树是否为其自身的镜像。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

For example, this binary tree is symmetric:

But the following is not:

Note:
Bonus points if you could solve it both recursively and iteratively.

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSymmetric(TreeNode *root) {
        return isSymmetric(root,root);
    }
private:
    bool isSymmetric(TreeNode *p,TreeNode *q){
        if(!p && !q) return true;
        if(p && q){
            if(p->val==q->val){
                bool lhs = isSymmetric(p->left,q->right);
                bool rhs = isSymmetric(p->right,q->left);
                return lhs && rhs;
            }else{
                return false;
            }
        }else{
            return false;
        }
    }
};