priority_queue.rb

require_relative "binary_heap"

# Implement a priority queue using a heap
# See: http://en.wikipedia.org/wiki/Priority_queue

class PriorityQueue
  # Enqueue +value+ with associated +priority+
  # O(log n) time
  def enqueue(value, priority)
  end

  # Dequeue the highest-priority item
  # O(log n) time
  def dequeue
  end

  # Return the highest-priority item w/o dequeing it
  def peek
  end
end