Introduction - If you have any usage issues, please Google them yourself
Double-ended heap to support double-ended priority queue insert, delete the smallest element and the largest such operation of the reactor element. Double-ended heap in logarithmic time to complete all of the above operation.