- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- An array consists of n elements. We want...

Q. |
## An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of |

A. | O(n*n*logn) |

B. | O(n*logn) |

C. | O(n*n) |

D. | O(n *logn *logn) |

Answer» B. O(n*logn) |

View all MCQs in:
Data Structures (DS)

- If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
- What is the worst-case time for heap sort to sort an array of n elements?
- The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
- The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
- What is the complexity of adding an element to the heap.
- The worst case complexity of deleting any arbitrary node value element from heap is
- Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?
- Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
- What is the time complexity to count the number of elements in the linked list?
- What is the time complexity of pre-order traversal in the iterative fashion?

Login to Continue

It will take less than 2 minutes

Report MCQ