package RandomPractice;
import util.*;
public class SameLeafNode {
public static boolean hasSameLeaf(BTNode root1, BTNode root2){
if(root1 == null && root2 == null)
return true;
if(root1 == null || root2 == null)
return false;
if(isLeaf(root1) && isLeaf(root2)){
if(root1.value == root2.value)
return true;
else
return false;
}
else{
boolean left = hasSameLeaf(root1.left, root2.left);
boolean right = hasSameLeaf(root1.right, root2.right);
return left && right;
}
}
public static boolean isLeaf(BTNode root){
if(root.left == null && root.right == null)
return true;
else
return false;
}
public static void main(String[] args){
BTNode root1 = new BTNode(1, null, null);
root1.left = new BTNode(3, null, null);
root1.right = new BTNode(10, null, null);
root1.left.left = new BTNode(11, null, null);
root1.left.right = new BTNode(13, null, null);
BTNode root2 = new BTNode(2, null, null);
root2.left = new BTNode(5, null, null);
root2.right = new BTNode(10, null, null);
root2.left.left = new BTNode(11, null, null);
root2.left.right = new BTNode(13, null, null);
System.out.println(hasSameLeaf(root1, root2));
}
}
[RandomCoding]SameLeafNode
最新推荐文章于 2021-11-12 15:36:36 发布