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