%0 Journal Article
%T Priority Queue Based on K-Ary Tree<br>基于K叉树的优先队列
%A TANG Kaishan
%A <br>唐开山
%J 系统工程理论与实践
%D 1999
%I 
%X 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.
%K priority queue
%K K
%K ary tree
%K K
%K ary tree heap<br>优先队列
%K K叉树
%K K叉树堆
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=F109D2081F9B8D22&yid=B914830F5B1D1078&vid=2A8D03AD8076A2E3&iid=DF92D298D3FF1E6E&sid=EFD65B51496FB200&eid=B62E0EEFE746E568&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=1&reference_num=0