Adding an element to a binary heap follows a time complexity of O(log n), a

What is the complexity of adding an element to the heap?

Question Posted / Mohd.asif

1 Answers
999 Views
I also Faced
E-Mail Answers

Answer Posted / Mohd.asif

Adding an element to a binary heap follows a time complexity of O(log n), assuming a complete binary tree.

Is This Answer Correct ?

0 Yes

0 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?

1271

Can you declare an array without assigning the size of an array?

1195

For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.

1380

Write a program for Sorting an Array. Which sorting will you prefer?

1034

Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

1488

What sort of serious problems have you experienced, and how have you handled them?

1020