普通的队列是一种先进先出的数据结构,元素在队列尾追加,而从队列头删除。在优先队列中,元素被赋予优先级。当访问元素时,具有最高优先级的元素最先删除。优先队列具有最高级先出 (first in, largest out) 的行为特征。
#Data Structure
This passage provides a description about queue and an implement for the queue in C.
This passage provides a description about stack and an implement for the stack in C.
This code provides a implement for the linkedList in C. It offers create, transverse, sort, inversion, append, insert, del and other functions of the linkedList.