DataStructure/QueueAL.java at master · darshanpatel44/DataStructure · 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
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
120
121
122
123
124
import java.util.*;

class QueueAL<D> implements Queue<D>
{

    Integer size=0;
    Integer buffer=10;


    Object arr[]=new Object[buffer];


    public void add(D o)
    {
        if(size==0)
        {
            arr[0]=o;
            size++;
        }


        else if(size==buffer)
            {
                buffer=buffer*2;

                Object arr2[]=new Object[buffer];

                for(Integer i=0;i<size;i++)
                {
                    arr2[i]=arr[i];
                }

                arr=arr2;
            }

            else
            {
            arr[size]=o;
            size++;
            }

        }

        public D peek ()
        {

            try{

                if(size<=0)
               {
                BoundsException ob=new BoundsException();
                throw ob;
               }
            }

            catch(BoundsException ob)
            {

                ob.printError();
                return null;

            }

            return (D)(arr[0]);

        }


        public D remove()
        {

                D temp=null;

            try{

                if(size<=0)
               {
                BoundsException ob=new BoundsException();
                throw ob;
               }
            }

            catch(BoundsException ob)
            {

                ob.printError();
                return null;

            }

            Object arr2[]=new Object[buffer];

                for(Integer i=1;i<=size;i++)
                {
                    arr2[i-1]=arr[i];
                }

                temp=(D)arr[0];
                arr=arr2;

                size--;

                return temp;

        }

        public void traverse()
        {
            for(Integer k=0;k<buffer;k++)
            System.out.println(arr[k]);
        }

        public Integer size()
        {

                return size;

        }


    }