LeetCode 100. 相同的树

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     struct TreeNode *left;
 6  *     struct TreeNode *right;
 7  * };
 8  */
 9 
10 bool isSameTree(struct TreeNode* p, struct TreeNode* q){
11     if(p==NULL&&q==NULL) return true;
12     else if(p&&q){
13         if(p->val==q->val){
14             return isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
15         }
16         else return false;
17     }
18     else return false;
19 }