Question
please help with final homework problem
2. Fill in the blanks and true or false. A A binary max-heap has distinct keys. A node in this heap has rank 86. The maximum height that this node can have in the heap is B. Consider a (weighted, undirected) graph such that every cut Tor F (circle one) of the graph has a unique light edge crossing it. Then the edge weights must be distinct C. A binary min heap has 383 distinct keys. The height of the heap is D. The smallest element in a max-heap is always on the last Tor F (circle one) row. For a binary heap of 383 nodes, the number of nodes of height one is
Explanation / Answer
b)True
d)True
c)O(log 383)
e)For a binary heap of 383 nodes,the number of nodes of height one is
log 383