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.

比较两个二叉树是否完全相同，包括节点的值和节点的结构

##问题解决

###C++代码

/**
* Definition for binary tree
* 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)  ) return false;
        return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
    }
};

##问题解析

该问题与Minimum Depth of Binary Tree 问题，等二叉树的问题都是一样的，需要运用递归不断查找