15算法课程 100. Same Tree



Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

solution:在判断两个二叉树皆存在且value相同时，用递归法逐步深入，判断它们的节点是否也相同。

code:

class Solution {public:    bool isSameTree(TreeNode* p, TreeNode* q) {        if (!p && !q)            return true;        if (!p || !q)            return false;        if (p->val != q->val)            return false;        return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);    }};