forked from ksameersrk/trees-hard-disk
-
Notifications
You must be signed in to change notification settings - Fork 0
/
TreesArray
116 lines (109 loc) · 2.28 KB
/
TreesArray
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
public class TreesArray
{
int arr[] = new int[100];
int root;
int left,right;
public TreesArray()
{
root = 1;
for(int i=0; i<100; i++)
{
arr[i] = -1;
}
}
public void insert(int key)
{
insert(root,key);
}
public void insert(int root,int key)
{
left = 2*root;
right = (2*root) + 1;
if(arr[root] == -1)
{
arr[root] = key;
}
else if(arr[root] > key)
{
insert(left,key);
}
else
{
insert(right,key);
}
}
public void countNodes()
{
int x = countNodes(root);
System.out.println("# of nodes : "+ x);
}
public int countNodes(int root)
{
if(arr[root] == -1)
{
return 0;
}
else
{
return 1 + countNodes(2*root) + countNodes((2*root)+1);
}
}
public void countLeaves()
{
int x = countLeaves(root);
System.out.println("# of leaves : "+x);
}
public int countLeaves(int root)
{
left = 2*root;
right = (2*root)+1;
if(arr[root] == -1)
{
return 0;
}
else if(arr[left] == -1 && arr[right] == -1)
{
return 1;
}
else
{
return countLeaves(2*root) + countLeaves((2*root)+1);
}
}
public void display()
{
System.out.println("Inorder : ");
inorder(root);
System.out.println("preorder : ");
preorder(root);
System.out.println("Postorder : ");
postorder(root);
}
public void inorder(int root)
{
if(arr[root] != -1)
{
inorder(2*root);
System.out.println(arr[root]);
inorder((2*root)+1);
}
}
public void preorder(int root)
{
if(arr[root] != -1)
{
System.out.println(arr[root]);
preorder(2*root);
preorder((2*root)+1);
}
}
public void postorder(int root)
{
if(arr[root] != -1)
{
postorder(2*root);
postorder((2*root)+1);
System.out.println(arr[root]);
}
}
}