568 views
1 votes
1 votes

Consider a complete Binary Tree ‘T’ with key of root node be ‘P’. It is given that the left and right subtree of ‘P’ satisfies min-heap property. What is the time taken to convert the given tree ‘T’ to a max heap ?

a)O(log N)

b) O(N)

1 Answer

Related questions

1 votes
1 votes
1 answer
2
jugnu1337 asked Apr 20, 2022
434 views
what is T.C. of this code: for(i=1;i<=n;i++) for(j=1;j<=n;j=j+i) x=x+1;
1 votes
1 votes
1 answer
3
0 votes
0 votes
1 answer
4
iarnav asked Jun 12, 2018
839 views
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?