Home / MCQ Bank / Computer
Computer Heaps Difficulty: Medium

In a binary min heap containing n elements, the largest element can be found in . . . . . . . . time.

Select the correct option to test your answer:

More Computer Questions

How to comment a single line? What will be the output of the following Python code? sentence = 'horses are fast' regex = re.compile('(?P<animal>\w+) (?P<verb>\w+) (?P<adjective>\w+)') matched = re.search(regex, sentence) print(matched.groupdict()) A task in a blocked state Node names and transitions must be conform to the following pattern =[a-zA-Z][\-_a-zA-Z0-0]*=, of up to . . . . . . . . characters long. What will be the output of the following C++ code? #include <iostream> using namespace std; int main () { int n; n = -77; cout.width(4); cout << internal << n << endl; return 0; }