Swift Data Structures and Algorithms

• Stack
• Queue
• HashMap on Chains
• HashMap on Open Addressing

Stack

TODO

Queue

Queue implementation in Swift

How to use

1. The initialization

let queue: Queue<Int> = Queue()

2. The insertion of element

queue.enqueue(3)

3. The check are there any elements in the queue

if !queue.isEmpty {
    // Some code here
}

4. The extraction of the element

// Use unwarping only when the queue is not Empty
let queueHead = queue.dequeue()!

5. The amount of elements in the queue

let amount = queue.count

6. The peek value

// Could be nil
let head = queue.peek()

HashMap on Chains

TODO

HashMap on Open Addressing

TODO