DSA/q.java at main · Erenjaegaaa/DSA · 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
public class q{
    class Node{
        int data;
        Node next;
        Node(int data){
            this.data=data;
            this.next=null;

        }
    }
    Node front,rear=null;
    void enq(int data){
        Node newnode=new Node(data);
        if(rear==null){
            front=rear=newnode;
            return;

        }
        rear.next=newnode;
        rear=newnode;
    }
    void deq(){
        if(front==null){
            System.out.println("empty");
            return;
        }
        front=front.next;
    }
    void traverse(){
        if(front==null){
            System.out.println("empty");
            return;
        }
        Node temp=front;
        while(temp!=null){
            System.out.print(temp.data+"-->");
            temp=temp.next;
        }
    }
    public static void main(String[]args){
        q q=new q();
        q.enq(10);
        q.enq(20);
        q.enq(30);
        q.traverse();

        q.deq();
        System.out.println();

        q.traverse();
        q.deq();
        System.out.println();
        q.traverse();
        q.deq();
        System.out.println();
        q.traverse();
    }
}