FilesExpand file tree

 master

/

QueueUsing2Stacks.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (46 loc) · 1.2 KB

 master

/

QueueUsing2Stacks.js

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (46 loc) · 1.2 KB

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

44

45

46

47

48

49

50

51

52

// implementation of Queue using 2 stacks

// contribution made by hamza chabchoub for a university project

class Queue {

constructor () {

this.inputStack = []

this.outputStack = []

}

// Push item into the inputstack

enqueue (item) {

this.inputStack.push(item)

}

dequeue () {

// push all items to outputstack

this.outputStack = []

while (this.inputStack.length > 0) {

this.outputStack.push(this.inputStack.pop())

}

// return the top element of the outputstack if any

if (this.outputStack.length > 0) {

const top = this.outputStack.pop()

// repush all the items to the inputstack

this.inputStack = []

while (this.outputStack.length > 0) {

this.inputStack.push(this.outputStack.pop())

}

return top

}

}

// display elements of the inputstack

listIn (output = value => console.log(value)) {

let i = 0

while (i < this.inputStack.length) {

output(this.inputStack[i])

i++

}

}

// display element of the outputstack

listOut (output = value => console.log(value)) {

let i = 0

while (i < this.outputStack.length) {

output(this.outputStack[i])

i++

}

}

}

export { Queue }