首页 > TAG信息列表 > JDK源码
JDK源码分析实战系列-PriorityQueue
PriorityQueuePriority queue represented as a balanced binary heap: the two children of queue[n] are queue[2n+1] and queue[2(n+1)]The element with the lowest value is in queue[0], assuming the queue is nonempty优先级队列在JDK中有一个教科书式的示范实现，以上是JDK