Priority Queue Based on K-Ary Tree
基于K叉树的优先队列

In this paper, a method of priority queue based on K ary tree is put forward through building structure of K ary tree heap, then geting priority queue of m items out of n items. The worst case time complexity of this method is O(2 m log 2 n 2n ). The method generalizes the method of priority queue based on 2 ary tree heap, and generates more efficiency.