- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- The worst case complexity of deleting an...

Q. |
## The worst case complexity of deleting any arbitrary node value element from heap is |

A. | O(logn) |

B. | O(n) |

C. | O(nlogn) |

D. | O(n2) |

Answer» A. O(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.
- 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
- What is the worst case time complexity of inserting a node in a doubly linked list?
- What is the worst-case time for heap sort to sort an array of n elements?
- What is the complexity of adding an element to the heap.
- In a max-heap, element with the greatest key is always in the which node?
- What is the best case and worst case complexity of ordered linear search?
- What is the space complexity for deleting a linked list?
- What is the worst case complexity of binary search using recursion?
- What is the worst case complexity of bubble sort?

Login to Continue

It will take less than 2 minutes

Report MCQ