一共3个源码，分别实现了有障碍的完全图的最小二叉树生成，以及一个用优先队列实现的优先级排序问题。详见内附文档。-A total of three source, respectively, are obstacles to achieving a complete map of the smallest binary tree generation, and a priority queue implemented with priority scheduling.

优先级队列实现，解决关键问题：1、如何根据元素的优先级快速找到新元素需要插入的位置；2、如何将新元素快速插入到队列中-Priority queue implementation, resolve key questions: 1, how to quickly find the location of a new element to be inserted according to the priority elements 2, how to quickly insert a new el