Register

gate : Heap questions

1,065 views
0 votes
0 votes

An array of integers of size n can be converted into a heap by adjusting the heaps rooted at each internal node of the complete binary tree starting at the node ⌊(n - 1) /2⌋, and doing this adjustment up to the root node (root node is at index 0) in the order ⌊(n - 1)/2⌋, ⌊(n - 3)/ 2⌋, ....., 0. The time required to construct a heap in this manner is

  1. O(log n)
  2. O(n)
  3. O (n log log n)
  4. O(n log n)

I dont get what question meant

can ny implemented on following array

1,2,3,4,5 ?

User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
Thor-o-s asked Sep 1, 2022
411 views
Algorithm which uses Max heap to find i smallest elements
Can anyone please explain how to find “ i “ smallest elements from an array whose elements are distinct Please use max heap to explain the working input : n distinct elements output : i smallest elements
Can anyone please explain how to find “ i “ smallest elements from an array whose elements are distinctPlease use max heap to explain the working input : n distinct e...
User Avatar
0 votes
0 votes
1 answer
2
atulcse asked Jan 16, 2022
713 views
max heap - algorithms - made easy test series
Consider the following graph: Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the above tree and element 10 occupies only the left child node of its parent.
Consider the following graph:Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the ...
User Avatar
2 votes
2 votes
1 answer
3
Nandkishor3939 asked Jan 15, 2019
3,322 views
Finding the minimum element in a Heap
I was going through the heap concept and one question came into my mind what will be the best case time complexity of finding the minimum element in a max heap? Thank you:)
I was going through the heap concept and one question came into my mind what will be the best case time complexity of finding the minimum element in a max heap?Thank you:...
User Avatar
0 votes
0 votes
1 answer
4
saurav raghaw asked Dec 22, 2018
685 views
MIN HEAP
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not? (A) O(log n) (B) O(n) (C) O(n logn) (D) O(1)
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not?(A) O(log n)(B) O(n)(C) O(n logn)(D) O(1)
User Avatar
Link Copied!