Register

Cormen Edition 3 Exercise 6.1 Question 5 (Page No. 154)

• retagged by
358 views

1 Answer

0 votes
0 votes
If the array is sorted in non-decreasing order, then yes it is a min heap. It follows straight from the definition of a min heap.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
akash.dinkar12 asked Apr 5, 2019
293 views
Cormen Edition 3 Exercise 6.1 Question 7 (Page No. 154)
Show that, with the array representation for storing an $n$-element heap, the leaves are the nodes indexed by $\lfloor n/2\rfloor +1$,$\lfloor n/2\rfloor +2,…,n$
Show that, with the array representation for storing an $n$-element heap, the leaves are the nodes indexed by $\lfloor n/2\rfloor +1$,$\lfloor n/2\rfloor +2,…,n$
User Avatar
0 votes
0 votes
2 answers
2
akash.dinkar12 asked Apr 5, 2019
1,430 views
Cormen Edition 3 Exercise 6.1 Question 6 (Page No. 154)
Is the array with values $23,17,14; 6,13,10,1,5,7,12$ a max-heap ?
Is the array with values $23,17,14; 6,13,10,1,5,7,12$ a max-heap ?
User Avatar
3 votes
3 votes
4 answers
3
akash.dinkar12 asked Apr 5, 2019
2,742 views
Cormen Edition 3 Exercise 6.1 Question 4 (Page No. 154)
Where in a max-heap might the smallest element reside, assuming that all elements are distinct ?
Where in a max-heap might the smallest element reside, assuming that all elements are distinct ?
User Avatar
Link Copied!