Heap Adjustment Algorithms Based on Complete Binary Tree Structure
2013 ◽
Vol 321-324
◽
pp. 2122-2127
Keyword(s):
Data Set
◽
In many applications, it is necessary to adjust the node position of complete binary tree, making the data set have the nature of heap. Because when binary tree node data volume is huge, it will be needed apparently for heap adjustment efficiency of repair algorithms which is based on heap linear list to be improved. Now an improved algorithm is proposed by experiments, which utilizes characteristics of priority queue (delete the earliest data) and stack (delete the latest data), and conducts stack pushing on binary tree node, then accesses node successively to call glide adjustment algorithm to improve the adjustment efficiency.
2014 ◽
Vol 25
(01)
◽
pp. 67-88
Keyword(s):
2017 ◽
Vol 8
(4)
◽
pp. 1-10
Keyword(s):
Keyword(s):
2012 ◽
Vol 479-481
◽
pp. 1403-1408
1996 ◽
Vol 29
(11)
◽
pp. 1905-1917
◽
Keyword(s):
2010 ◽
Vol 25
(3)
◽
Keyword(s):
2010 ◽
Vol 14
(4)
◽
pp. 375-381
Keyword(s):