首页 > 代码库 > [LeetCode] Same Tree
[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 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){ if(p!=NULL || q!=NULL) return false; else return true; } if((p->val == q->val) && isSameTree(p->left,q->left) && isSameTree(p->right,q->right)) return true; else return false; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。