LeetCode Path Same Tree

 1 /**
 2  * Definition for binary tree
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     bool isSameTree(TreeNode *p, TreeNode *q) {
13         // Start typing your C/C++ solution below
14         // DO NOT write int main() function
15         if(p==0&q==0)
16             return true;
17         if((p==0)^(q==0))
18             return false;
19         if(p->val!=q->val)
20             return false;
21         if((p->left==0)^(q->left==0))
22             return false;
23         if((p->right==0)^(q->right==0))
24             return false;
25         if(p->left&&!isSameTree(p->left,q->left))
26             return false;
27         if(p->right&&!isSameTree(p->right,q->right))
28             return false;
29         return true;
30     }
31 };
32 
33 //4ms
34 //12ms