-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueueUsingList.csx
More file actions
79 lines (74 loc) · 1.99 KB
/
Copy pathQueueUsingList.csx
File metadata and controls
79 lines (74 loc) · 1.99 KB
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
class Queue
{
class Node
{
public int Data { get; set; }
public Node Next { get; set; }
}
public Node Front { get; set; }
public Node Rear { get; set; }
public Queue()
{
Front = Rear = null;
}
public bool Push(int data)
{
Node node = new Node() { Data = data, Next = null };
if (Front == null)
{
Front = Rear = node;
return true;
}
Rear.Next = node;
Rear = node;
return true;
}
public int Pop()
{
if (Front == null)
return -1;
int data = Front.Data;
Front = Front.Next;
if (Front == null)
Rear = null;
return data;
}
}
class Program
{
static void Main(string[] args)
{
Queue queue = new Queue();
int data;
Console.WriteLine("Welcome to queue using Linked List program");
int choice = -1;
while (choice != 0)
{
Console.WriteLine("0.Exit");
Console.WriteLine("1.Push");
Console.WriteLine("2.Pop");
Console.WriteLine("Please enter appropriate choice");
choice = int.Parse(Console.ReadLine());
switch (choice)
{
case 1:
Console.WriteLine("Please enter the element");
data = int.Parse(Console.ReadLine());
if (queue.Push(data))
Console.WriteLine("Element pushed successfully");
else
Console.WriteLine("Cant push element, Queue is full");
break;
case 2:
data = queue.Pop();
if (data == -1)
Console.WriteLine("Queue is already empty");
else
Console.WriteLine("Element: " + data);
break;
default:
break;
}
}
}
}