forked from ksameersrk/trees-hard-disk
-
Notifications
You must be signed in to change notification settings - Fork 0
/
arrayTree.java
100 lines (98 loc) · 1.68 KB
/
arrayTree.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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
public class arrayTree
{
int arrayTree[] = new int[100];
int root;
public arrayTree()
{
root =1;
for(int i=1;i<100;i++)
arrayTree[i] = -1;
}
public void insert(int key)
{
insert(root,key);
}
public void insert(int root,int key)
{
if(arrayTree[root] == -1)
{
arrayTree[root] = key;
}
else if(arrayTree[root] < key)
{
insert((2*root)+1,key);
}
else
{
insert((2*root),key);
}
}
public void disp()
{
System.out.println("Inorder");
inorder(root);
System.out.println("PreOrder");
preorder(root);
System.out.println("PostOrder");
postorder(root);
System.out.println("Internal Nodes "+countInternal(root));
System.out.println("External Nodes "+countExternal(root));
}
public void inorder(int root)
{
if(arrayTree[root] != -1)
{
inorder(2*root);
System.out.println(arrayTree[root]);
inorder((2*root)+1);
}
}
public void preorder(int root)
{
if(arrayTree[root] != -1)
{
System.out.println(arrayTree[root]);
preorder(2*root);
preorder((2*root)+1);
}
}
public void postorder(int root)
{
if(arrayTree[root] != -1)
{
postorder(2*root);
postorder((2*root)+1);
System.out.println(arrayTree[root]);
}
}
public int countInternal(int root)
{
if(arrayTree[root] == -1)
{
return 0;
}
else if(arrayTree[(2*root)]==-1 && arrayTree[(2*root)+1]==-1 )
{
return 0;
}
else
{
return 1+countInternal(2*root)+countInternal((2*root)+1);
}
}
public int countExternal(int root)
{
if(arrayTree[root] == -1)
{
return 0;
}
else if(arrayTree[(2*root)]==-1 && arrayTree[(2*root)+1]==-1 )
{
return 1;
}
else
{
return countExternal(2*root) + countExternal((2*root)+1);
}
}
}