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