diff --git a/Data Structures.playground/Pages/Heap.xcplaygroundpage/Contents.swift b/Data Structures.playground/Pages/Heap.xcplaygroundpage/Contents.swift
new file mode 100644
index 0000000..cffb87a
--- /dev/null
+++ b/Data Structures.playground/Pages/Heap.xcplaygroundpage/Contents.swift	
@@ -0,0 +1,242 @@
+//: [Previous](@previous)
+
+import Foundation
+
+public struct Heap<T> where T: Comparable, T: CustomStringConvertible {
+    
+    // MARK: - Constants
+    
+    private let zero = 0
+    
+    // MARK: - Properties
+    
+    var nodes = [T]()
+    
+    public var isEmpty: Bool {
+        return nodes.isEmpty
+    }
+    
+    public var count: Int {
+        return nodes.count
+    }
+    
+    // MARK: - Private properties
+    
+    fileprivate var order: (T, T) -> Bool
+    
+    // MARK: - Initializers
+    
+    public init(order: @escaping (T, T) -> Bool) {
+        self.order = order
+    }
+    
+    public init(array: [T], order: @escaping (T, T) -> Bool) {
+        self.order = order
+        setup(using: array)
+    }
+    
+    // MARK: - Methods
+    
+    public func peek() -> T? {
+        return nodes.first
+    }
+    
+    public mutating func insert(node: T) {
+        nodes.append(node)
+        shiftUp(count - 1)
+    }
+    
+    public mutating func insert<S: Sequence>(_ sequence: S) where S.Iterator.Element == T {
+        sequence.forEach { element in
+            insert(node: element)
+        }
+    }
+    
+    public mutating func replace(elementAt index: Int, with value: T) {
+        guard index < nodes.count else { return }
+        remove(at: index)
+        insert(node: value)
+    }
+    
+    @discardableResult public mutating func remove() -> T? {
+        guard !nodes.isEmpty else { return nil }
+        
+        switch nodes.count {
+        case 1:
+            return nodes.removeLast()
+        default:
+            let value = nodes[zero]
+            nodes[zero] = nodes.removeLast()
+            shiftDown(zero)
+            return value
+        }
+    }
+    
+    @discardableResult public mutating func remove(at index: Int) -> T? {
+        guard index < nodes.count else { return nil }
+        let size = count - 1
+        
+        if index != size {
+            nodes.swapAt(index, size)
+            shiftDown(from: index, until: size)
+            shiftUp(index)
+        }
+        return nodes.removeLast()
+    }
+    
+    // MARK: - Shifting
+    
+    internal mutating func shiftDown(from startIndex: Int, until endIndex: Int) {
+        let leftChildIndex = self.leftChildIndex(of: startIndex)
+        let rightChildIndex = leftChildIndex + 1
+        var first = startIndex
+        
+        if leftChildIndex < endIndex && order(nodes[leftChildIndex], nodes[first]) {
+            first = leftChildIndex
+        }
+        if rightChildIndex < endIndex && order(nodes[rightChildIndex], nodes[first]) {
+            first = rightChildIndex
+        }
+        if first == startIndex { return }
+        
+        nodes.swapAt(startIndex, first)
+        shiftDown(from: first, until: endIndex)
+    }
+    
+    internal mutating func shiftDown(_ index: Int) {
+        shiftDown(from: index, until: count)
+    }
+    
+    internal mutating func shiftUp(_ index: Int) {
+        var childIndex = index
+        let child = nodes[childIndex]
+        var parentIndex = self.parentIndex(of: childIndex)
+        
+        while childIndex > 0 && order(child, nodes[parentIndex]) {
+            nodes[childIndex] = nodes[parentIndex]
+            childIndex = parentIndex
+            parentIndex = self.parentIndex(of: childIndex)
+        }
+        nodes[childIndex] = child
+    }
+    
+    // MARK: - Child indicies
+    
+    @inline(__always) internal func rightChildIndex(of index: Int) -> Int {
+        return 2 * index + 2
+    }
+    
+    @inline(__always) internal func leftChildIndex(of index: Int) -> Int {
+        return 2 * index + 1
+    }
+    
+    @inline(__always) internal func parentIndex(of index: Int) -> Int {
+        return (index - 1) / 2
+    }
+    
+    // MARK: - Private helpers
+    
+    private mutating func setup(using nodesArray: [T]) {
+        self.nodes = nodesArray
+        let strideCondition = stride(from: (count / 2 - 1), through: 0, by: -1)
+        
+        for index in strideCondition {
+            shiftDown(index)
+        }
+    }
+    
+}
+
+/*:
+ Basically we created wrapper around standard Array type. However we need to carefully take a look at the two important pieces of the implenentation:
+ - T type which is a generic placeholder
+ - Custom initializer that accepts iterator element of Sequence protocol - this is simply a complementary initializer that allows client-developer to pass other Stack structs, Arra or any other type that conforms to Sequnce protocol to use it at initialization phase. Convenience and compatability with standard library - nothing sophisticated.
+ 
+ 
+ The following extension adds support for debugging capabilites for both regular "print" and "debugPrint" statements
+ */
+extension Heap: CustomStringConvertible, CustomDebugStringConvertible {
+    
+    // MARK: - Properties
+    
+    public var description: String {
+        return nodes.description
+    }
+    
+    public var debugDescription: String {
+//        prepareDebugPrint()
+        return nodes.debugDescription
+    }
+    
+    /*
+    func prepareDebugPrint() -> String {
+        var innerLength = 1
+        var start = 0
+        var end = innerLength
+    
+        
+        for var index in 0..<count {
+
+//            Swift.print(innerLength)
+            Swift.print("start: ", start, " end: ", end)
+            
+            for val in start..<end {
+                Swift.print(val)
+            }
+            
+            if innerLength == count {
+                break
+            }
+            
+            if innerLength <= 1 {
+                innerLength += 1
+            } else {
+                innerLength *= 2
+            }
+            
+            start = index + 1
+            end = innerLength + 1
+
+            if innerLength > count {
+                innerLength = count
+            }
+        }
+        return ""
+    }
+    */
+    
+}
+
+extension Heap: ExpressibleByArrayLiteral {
+    
+    public init(arrayLiteral elements: T...) {
+        self.init(array: elements, order: <)
+    }
+}
+
+/*:
+ Adds support for Sequence protocol. The Swift's runtime will call the makeIterator() method to initialize the for...in loop. All we need to do is to return some soft of iterator instance that conforms to IteratorProtocol. Iterator protocol allows us to return an iterator based on the type of elements out target type contains - in this particular case it is Stack.
+ */
+extension Heap: Sequence {
+    
+    public func makeIterator() -> AnyIterator<T> {
+        let idexedIterator = IndexingIterator(_elements: self.nodes.lazy.reversed())
+        return AnyIterator(idexedIterator)
+    }
+}
+
+
+//: Usage
+
+
+var maxHeap = Heap<Int>(order: >)
+maxHeap.insert(node: 1)
+maxHeap.insert(node: 5)
+maxHeap.insert(node: 2)
+maxHeap.insert(node: 7)
+maxHeap.insert(node: 9)
+
+//var heap: Heap = [3, 1, 4, 2, 7, 9, 8]
+
+
+//: [Next](@next)
diff --git a/Data Structures.playground/contents.xcplayground b/Data Structures.playground/contents.xcplayground
index 45ab340..9a85084 100644
--- a/Data Structures.playground/contents.xcplayground	
+++ b/Data Structures.playground/contents.xcplayground	
@@ -8,5 +8,6 @@
         <page name='Linked List'/>
         <page name='Tree'/>
         <page name='Graph'/>
+        <page name='Heap'/>
     </pages>
 </playground>
\ No newline at end of file