leetcode101. Symmetric Tree

Q:

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

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

1
/ \
2 2
/ \ / \
3 4 4 3

But the following [1,2,2,null,3,null,3] is not:

1
/ \
2 2
\ \
3 3

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

思路

迭代法：类似于判断两个二叉树是否相同，改变压栈顺序即可

AC解：

class Solution {
public:
    bool isSymmetric(TreeNode* root) 
    {
        stack<TreeNode*> s;
        if (root == nullptr)
            return true;

        TreeNode *p = root->left, *q = root->right;
        s.push(p);
        s.push(q);

        while (!s.empty())
        {
            q = s.top();    s.pop();
            p = s.top();    s.pop();

            if (q == nullptr && p == nullptr)   continue;
            if (q == nullptr || p == nullptr)   return false;
            if (q->val != p->val)               return false;
            //一个从左往右入栈，一个从右往左入栈
            s.push(p->left);
            s.push(q->right);
            s.push(p->right);
            s.push(q->left);
        }

        return true;
    }
};

递归法：也类似于判断两个二叉树是否相同的解法，改变传入的参数即可

AC解：

 //递归解法
class Solution {
public:
    bool isSymmetric(TreeNode* root) 
    {
        if (root == nullptr)
            return true;

        TreeNode *p = root->left, *q = root->right;

        return recurse(p, q);
    }

    bool recurse(TreeNode *p, TreeNode *q)
    {
        if (p == nullptr && q == nullptr)   return true;//终止条件
        if (p == nullptr || q == nullptr)   return false;   //剪枝

        return p->val == q->val && recurse(p->left,q->right)    //三方合并
                && recurse(p->right,q->left);
    }
};