ABSTRACT
In practical applications, data set with priority queue[1]
produces convenience for various searching. Searching is to search for data elements that meet certain conditions from data set, which is one of the most common operations in data processing. For searching structure organized by different ways, the corresponding search methods are different as well. The nature of searching structure also tends to affect the searching speed. For data set exists in the form of complete binary tree[1,2] structure, adjust before searching can make data set have the nature of heap[2,3], improving searching speed. The adjusting method is concerned with the efficiency of the whole process.
