Queue Implementation

Queue.swift

private class ListNode {
    var next: ListNode?
    var prev: ListNode?
    var key: Int = 0
}
/*
 push to back, peek/pop from front, size and is empty
 */
class Queue {
    private var head: ListNode?
    private var tail: ListNode?
    private var count: Int = 0
    
    func push(_ key: Int) {
        let newNode = ListNode()
        newNode.key = key
        
        if head == nil {
            head = newNode
            tail = newNode
        }
        else {
            tail?.next = newNode
            tail = tail?.next
        }
        
        count += 1
    }
    
    func peak() -> Int {
        return head?.key ?? 0
    }
    
    func popFront() -> Int {
        let frontNode = head
        head = head?.next
        
        if head == nil {
            tail = nil
        }
        
        count -= 1
        
        return frontNode?.key ?? 0
    }
    
    func size() -> Int {
        return count
    }
    
    func isEmpty() -> Bool {
        return size() == 0
    }
}