Register

What are the time complexities of following operatons ? Justify

261 views
0 votes
0 votes
Q1) Conversion from Tree to Heap (max heap and min heap)
Q2) Conversion from Max Heap to Binary Search Tree

Q3) Conversion from Min Heap to Binary Search Tree

( NB:Please justify your answer so that one who reads could understand the concepts behind
including me :p )
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
1 answer
1
Nikita Moghe asked Apr 25, 2016
661 views
Recurrence relation with multiplication of two time complexities
Given T(1) = a, T(2) = b Solve T(n) = T(n-1) * T(n-2)
Given T(1) = a, T(2) = bSolve T(n) = T(n-1) * T(n-2)
User Avatar
Link Copied!