Implement a Bernoulli tree. The following operations are implemented: 1.insert X, adding integer X to the priority queue 2.delete, the minimum value in the priority queue is popped out 3.min, output minimum The initial priority queue is empty.

Filename	Size	Update
1215. bernoulli.cpp	4539	2016-05-21

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．