LeetCode Q100: 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.

	/**
	* 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 true;
	else{
	if((p==NULL&&q!=NULL) || (p!=NULL && q==NULL))
	return false;
	}
	if(p->val!=q->val)
	return false;
	bool r0=isSameTree(p->left, q->left);
	bool r1=isSameTree(p->right, q->right);
	return r0&&r1;
	}
	};

view raw Q100SameTree.cpp hosted with ❤ by GitHub