Same Tree

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.

思路

分开考虑几种情况，然后递归

代码1

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
    if(p==NULL&&q==NULL)
        return true;
    else if(p==NULL&&q!=NULL)
        return false;
    else if(p!=NULL&&q==NULL)
        return false;
    else if(p->val!=q->val)
        return false;
    else return isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);

}

代码2

  if (!p && !q) return true;
  if (!(p && q)) return false;

代码3

bool isSameTree(TreeNode* p, TreeNode* q) {
    if (!p || !q) return q == p;
    return p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}