chihits

摘要： A short summary of Chapter 6 Heapsort from Introduction to Algorithms1. What is a binary heap?A binary heap is a nearly complete binary tree that has the max(min) heap property:each node is greater than or equal to any of its children. As a result, the maximum(minimum) element in a max(min) heap is 阅读全文