leetcode || 100、Same Tree

problem：

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.

Hide Tags

Tree Depth-first
Search

题意：检查两棵 二叉树是否相同 ，二叉树相同定义：1、结构相同 2、每个节点的数值相等

thinking：

使用深搜，一边检查结构一边检查数值

code：

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->val!=q->val)
              return false;
              return isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
      }
  };