LeetCode *** 100. 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;        if(p==NULL&&q!=NULL)return false;        if(p!=NULL&&q==NULL)return false;        if(p->val==q->val&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right))return true;        else return false;    }};