Information Technology and Computer Application Engineering – Liu, Sung & Yao (Eds)
© 2014 Taylor & Francis Group, London, ISBN 978-1-138-00079-7
Heap adjustment algorithms based on complete binary tree structure
and based on array
Yuan Hu
Department of Computer Technology and Applications Qinghai University, Xining, Qinghai, China
ABSTRACT: For the given complete binary tree, the heap adjustment algorithm based on array and based on
complete binary tree structure are proposed, making the data set have the nature of heap. While Useing different
algorithms to achieve the same conversion, heap adjustment algorithms based on complete binary tree structure
is the better algorithm by experiments, which utilizes characteristics of priority queue (delete ...