-
Notifications
You must be signed in to change notification settings - Fork 1
/
Heap.c
119 lines (108 loc) · 2.09 KB
/
Heap.c
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
117
118
119
#include<stdio.h>
#include<stdlib.h>
void insert_node(int arr[],int i, int n)
{
while(i>1)
{
if(n < arr[i/2])
{
arr[i]=n;
return;
}
arr[i]=arr[i/2];
i=i/2;
}
arr[i]=n;
}
void del(int arr[], int index)
{
if(index <= 1)
{
printf("\n Tree is Empty.");
return;
}
int i=1,j=i*2;
arr[1]=arr[index-1];
index--;
while(j < index)
{
if(arr[j+1] > arr[j])
{
j=j+1;
}
if(arr[j] > arr[i])
{
int temp;
temp=arr[j];
arr[j]=arr[i];
arr[i]=temp;
//swap(&arr[j],&arr[i]);
i=j;
j=i*2;
}
else
break;
}
}
void swap(int *p, int *q)
{
int temp;
temp=*p;
*p=*q;
*q=temp;
}
void view(int arr[], int i)
{
if(i <= 1)
{
printf("\n Tree is empty.");
return ;
}
int j;
for(j=1;j<i;j++)
printf(" %d ",arr[j]);
}
int menu()
{
int ch;
printf("\n------------------------------------------");
printf("\n\t Heap Tree Operation");
printf("\n------------------------------------------");
printf("\n\n 1. Insert Element.");
printf("\n 2. Display heap tree.");
printf("\n 3. Delete Element.");
printf("\n Press 0 for Exit.");
printf("\n\n Enter your choice: ");
scanf("%d",&ch);
return ch;
}
int main()
{
int x,arr[10];
static int index = 1;
while(1)
{
switch(menu())
{
case 1:
printf("\n Enter Number: ");
scanf("%d",&x);
insert_node(arr,index++,x);
printf("\n Node added successfully.");
break;
case 2:
view(arr,index);
break;
case 3:
del(arr,index--);
printf("\n Node deleted Successfully...");
break;
case 0:
printf("\n Thank You for Using....\n\n");
exit(0);
break;
default:
printf("\n Wrong choice....");
}
}
}