forked from xurui1995/Sword-pointing-to-offer
-
Notifications
You must be signed in to change notification settings - Fork 0
/
No18.java
57 lines (48 loc) · 1.57 KB
/
No18.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
public class No18 {
/**
* 输入两颗二叉树A和B,判断B是不是A的子结构
*/
public static void main(String[] args) {
BinaryTreeNode node1=new BinaryTreeNode(8);
BinaryTreeNode node2=new BinaryTreeNode(8);
BinaryTreeNode node3=new BinaryTreeNode(7);
BinaryTreeNode node4=new BinaryTreeNode(9);
BinaryTreeNode node5=new BinaryTreeNode(2);
BinaryTreeNode node6=new BinaryTreeNode(4);
BinaryTreeNode node7=new BinaryTreeNode(7);
node1.setLchildNode(node2);node1.setRchildNode(node3);
node2.setLchildNode(node4);node2.setRchildNode(node5);
node5.setLchildNode(node6);node5.setRchildNode(node7);
BinaryTreeNode a=new BinaryTreeNode(8);
BinaryTreeNode b=new BinaryTreeNode(9);
BinaryTreeNode c=new BinaryTreeNode(2);
a.setLchildNode(b);a.setRchildNode(c);
System.out.println(hasSubTree(node1,a));
}
private static boolean hasSubTree(BinaryTreeNode root1, BinaryTreeNode root2) {
boolean result=false;
if(root1!=null&&root2!=null){
if(root1.getData()==root2.getData()){
result=doseTree1HaveTree2(root1,root2);
if(!result){
result=hasSubTree(root1.getLchildNode(), root2);
}
if(!result)
result=hasSubTree(root1.getRchildNode(), root2);
}
}
return result;
}
private static boolean doseTree1HaveTree2(BinaryTreeNode root1,
BinaryTreeNode root2) {
if(root2==null)
return true;
if(root1==null)
return false;
if(root1.getData()!=root2.getData()){
return false;
}
return doseTree1HaveTree2(root1.getLchildNode(), root2.getLchildNode())
&&doseTree1HaveTree2(root1.getRchildNode(), root2.getRchildNode());
}
}