stack_and_queue_based_with_deque.swift

import DequeModule

struct Stack<T> {
    private var deque: Deque<T> = []
    
    var top: T? { deque.last }
    
    mutating func push(_ element: T) {
        deque.append(element)
    }
    
    mutating func pop() -> T? {
        return deque.popLast()
    }
}

struct Queue<T> {
    private var deque: Deque<T> = []
    
    var head: T? { deque.first }
    var tail: T? { deque.last }
    
    mutating func enqueue(_ element: T) {
        deque.append(element)
    }
    
    mutating func dequeue() -> T? {
        return deque.popFirst()
    }
}

var stack = Stack<Int>()
var queue = Queue<Int>()

stack.push(1)
stack.push(2)
stack.pop() // 2

queue.enqueue(1)
queue.enqueue(2)
queue.dequeue() // 1