首页 > 代码库 > LeetCode: Same Tree
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.
地址：https://oj.leetcode.com/problems/same-tree/
算法：递归解决，很简单。代码：
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 && !q) return true;14 if(!p && q || p && !q) return false;15 if(p && q && p->val != q->val) return false;16 bool left = isSameTree(p->left, q->left);17 bool right = isSameTree(p->right,q->right);18 return left && right;19 }20 }; 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 && !q) return true;14 if(!p && q || p && !q) return false;15 if(p && q && p->val != q->val) return false;16 bool left = isSameTree(p->left, q->left);17 bool right = isSameTree(p->right,q->right);18 return left && right;19 }20 };
LeetCode: Same Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。