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.

Subscribe to see which companies asked this question

题目的意思就是给出两个2叉树，判断是不是同一棵树，这段代码是通过压入栈的方式来判断的。

/** * 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==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);    }