[LeetCode] 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.

class Solution {
public:
	bool isSameTree(TreeNode *p, TreeNode *q) {
		// Start typing your C/C++ solution below
		// DO NOT write int main() function
		if(p==NULL&&q==NULL) return true;
		else if((p==NULL&&q!=NULL)||(p!=NULL&&q==NULL)) return false;
		else if((p->val)!=(q->val)) return false;
		if(isSameTree(p->left,q->left))
			return isSameTree(p->right,q->right);

	}
};