How to use the heap to sort:如何用堆来实现排序： A: Continue to call delMax() after building a heap建堆后不断调用delMax() B: Continue to call getMax() after building a heap建堆后不断调用getMax() C: Continue to call insert() after building a heap建堆后不断调用insert() D: Build the heap建堆

How to use the heap to sort:如何用堆来实现排序：- 未答 A: Continue to call delMax() after building a heap建堆后不断调用delMax() B: Continue to call getMax() after building a heap建堆后不断调用getMax() C: Continue to call insert() after building a heap建堆后不断调用insert() D: Build the heap建堆

The time complexity of building a complete binary heap of size n by the Floyd build-heap algorithm is:Floyd建堆算法建立规模为n的完全二叉堆的时间复杂度为： A: O(nlgn) B: O(n) C: O(lgn) D: O(1)

假定Point为类类型，该类类型有一个复制构造函数，指出下面程序段中每一个使用了复制构造函数的地方：point global；Point foo_bar（Point arg）{      Point local=arg；      Point*heap=new Point（global）；       *heap=local；        roint pa[4]={local，*heap}；        return*heap；}      *heap=local;      Point pa[4]={ local,*heap);       return *heap;}

名词解释：运行时堆（ runtime heap）

A heap must be a full binary tree

A heap must be a complete binary tree

Heap is not necessarily a complete binary tree

heap和stack有什么区别?

Heap与stack的差别？