首页 > 代码库 > 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.
1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */10 class Solution{11 public:12 bool isSameTree(TreeNode *p,TreeNode *q){13 if(p==NULL&&q==NULL)14 {15 return true;16 }17 if(p&&q&&p->val==q->val)18 {19 return (isSameTree(p->left,q->left))&&(isSameTree(p->right,q->right));20 }21 else22 {23 return false;24 }25 }26 };
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。