1. Same Tree My Submissions QuestionEditorial Solution
   
   Total Accepted: 126116 Total Submissions: 291884 Difficulty: Easy
   
   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.

Subscribe to see which companies asked this question

思路：太简单，主要p,q为空考虑到，并用一行代码实现

/**

 * Definition for a binary tree node.

 * struct TreeNode {

 *     int val;

 *     TreeNode *left;

 *     TreeNode *right;

 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}

 * };

 */

class Solution {

public:

    bool isSameTree(TreeNode* p, TreeNode* q) {

        if(p==NULL||q==NULL)return p==q;

        if(p->val==q->val)

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

        else return false;

    }

};