[LeetCode] 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;
*     struct TreeNode *left;
*     struct TreeNode *right;
* };
*/
bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
if(!p && !q) return true;
if(!p || !q) return false;
return p->val == q->val && isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
}