Data-structures/heap-insert.cpp at master · bilalkhann16/Data-structures · GitHub

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
//minheap insertion
#include<iostream>
using namespace std;

class Heap{
    public:
    int h[9];
    int n,maxsize;
    Heap()
    {
        n=0;
        maxsize=8;
        h[0]=-1;
    }

    void insert(int x)
    {
        if (n==maxsize)
        {
            cout<<"heap is full";
            return;
        }
            n++;
        cout<<"n: "<<n<<endl;
        int k;
        for (k=n;k>1;k=k/2)
        {
            if (x>h[k/2])
            {
                cout<<"No shifting required";
                break;
            }
            h[k]=h[k/2];
        }

        h[k]=x;

    }


    void print()
    {
        for (int i=0;i<8;i++)
        {
            cout<<h[i]<<" ";
        }
    }
};


int main()
{
    Heap h;
    h.insert(10);
    h.insert(20);
    h.insert(100);
    h.insert(30);
    h.insert(40);

    h.insert(50);
    h.insert(12);


    h.print();


}