101. Symmetric Tree

来源:互联网 发布:淘宝代购店铺介绍 编辑:程序博客网 时间:2024/06/05 09:55
/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:    deque<TreeNode *> de;    bool isSymmetric(TreeNode* root) {        //de = medium(root , de );        if(root == NULL){            return true;        }        return theSameNode(root->left,root->right);    }    bool theSameNode(TreeNode * le , TreeNode * ri){        if(!le && !ri){            return true;        }        if(!le || !ri){            return false;        }        if(le->val == ri->val){            return theSameNode(le->left,ri->right)&&theSameNode(ri->left,le->right);        }        else{            return false;        }    }};
//递归法

0 0
原创粉丝点击