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