首页 > 代码库 > 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.
Solution:
1 /** 2 * Definition for binary tree 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */10 public class Solution {11 public boolean isSameTree(TreeNode p, TreeNode q) {12 boolean res = isSameTreeRecur(p,q);13 14 return res;15 }16 17 public boolean isSameTreeRecur(TreeNode left, TreeNode right){18 if ((left==null&&right!=null)||(left!=null&&right==null))19 return false;20 21 if (left==null&&right==null)22 return true;23 24 if (left.val!=right.val)25 return false;26 27 if (left.left==null&&left.right==null&&right.left==null&&right.right==null)28 return true;29 30 boolean leftSame = isSameTreeRecur(left.left,right.left);31 if (!leftSame)32 return false;33 34 boolean rightSame = isSameTreeRecur(left.right,right.right);35 if (!rightSame)36 return false;37 38 return true;39 }40 }
Similar to the symmetric tree problem. Need to consider every possible situation carefully.
Leetcode-Same Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。