【每日一题】100.相同的树

题目：https://leetcode-cn.com/problems/same-tree/

解法 1，递归
很容易理解。

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if (p == nullptr && q == nullptr) return true;
        if (p == nullptr || q == nullptr) return false;

        return (p->val == q->val)
            && (isSameTree(p->left, q->left))
            && (isSameTree(p->right, q->right));
    }
};

解法 2，非递归
非递归方法类似于将快排的非递归写法。

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if (p == nullptr && q == nullptr) return true;
        if (p == nullptr || q == nullptr) return false;

        stack<map<char, TreeNode*>> s;
        map<char, TreeNode*> m1;
        m1['p'] = p;  m1['q'] = q;
        s.push(m1);

        while (!s.empty()) {
            auto m = s.top();  s.pop();
            if (m['p'] == nullptr && m['q']==nullptr) continue;
            if ((m['p'] != nullptr && m['q'] == nullptr)
                || (m['p'] == nullptr && m['q'] != nullptr)) 
                return false;
            if (m['p']->val != m['q']->val) return false;
            
            map<char, TreeNode*> tmp;
            tmp['p'] = m['p']->left;  tmp['q'] = m['q']->left;
            s.push(tmp);
            tmp['p'] = m['p']->right;  tmp['q'] = m['q']->right;
            s.push(tmp);
        }
        return true;
    }
};

---

EOF