The Gateway to Computer Science Excellence
+1 vote
73 views
StateTrue/False:

Conversion of Max heap into a binary search tree takes O(n) time.
in Programming by Junior (867 points) | 73 views
0
why bother having nlog(n) algorithm then?
0
False :takes nlogn time

1. delete elements in max heap that gives ascending order and inorder of BST is ascending order , so converted into bst.

2. given array elements sort them in ascending order is also BST

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,390 answers
198,589 comments
105,443 users