首页 > 代码库 > leetCode Symmetric Tree
leetCode Symmetric Tree
非递归解法
/** * 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) { stack <TreeNode*> stackLeft; stack <TreeNode*> stackRight; if(root == NULL ||(root && (!root->left) && (!root->right))){ return true; } if((root->left && (!root->right))||(!root->left && root->right)){ return false; } TreeNode *pLeft = root->left; TreeNode *pRight = root->right; while((pLeft||(!stackLeft.empty())) && (pRight ||(!stackRight.empty()))){ while(pLeft && pRight){ if(pLeft->val != pRight->val){ return false; } stackLeft.push(pLeft); pLeft = pLeft->left; stackRight.push(pRight); pRight = pRight->right; } if(pLeft || pRight){ return false; } pLeft = stackLeft.top(); stackLeft.pop(); pLeft = pLeft->right; pRight = stackRight.top(); stackRight.pop(); pRight = pRight->left; } if( (pLeft||(!stackLeft.empty())) || (pRight ||(!stackRight.empty()))){ return false; } return true; } };</span>
递归解法
leetCode Symmetric Tree
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。