FilesExpand file tree

 basic-tutorials

/

22_queue.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (41 loc) · 913 Bytes

 basic-tutorials

/

22_queue.py

Top

File metadata and controls

• Code
• Blame

43 lines (41 loc) · 913 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

# Queue -> First In First Out (FIFO)

l=[]

while True:

c=int(input('''

1. Push

2. Pop First Element

3. Front Element

4. Last Element

5. Display Element

6. Exit

Please choose an option :

'''))

if c==1:

n = input("Enter the value : ")

l.append(n)

print(l)

elif c==2:

if len(l)==0:

print("Empty Stack")

else:

del l[0]

print(l)

elif c==3:

if len(l) == 0:

print("Empty Stack")

else:

print(l[0])

elif c == 4:

if len(l) == 0:

print("Empty Stack")

else:

print(l[-1])

elif c == 5:

if len(l) == 0:

print("Empty Stack")

else:

print(l)

elif c == 6:

break

else:

print("Invalid")