📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    Question

    A priority queue is a special type of queue where each

    element has a priority. What is the typical time complexity for inserting an element into a priority queue implemented using a binary heap?
    A O(1) Correct Answer Incorrect Answer
    B O(log N) Correct Answer Incorrect Answer
    C O(N) Correct Answer Incorrect Answer
    D O(N log N) Correct Answer Incorrect Answer
    E O(N²) Correct Answer Incorrect Answer

    Solution

    A priority queue implemented using a binary heap maintains the heap property. Inserting an element involves adding it to the end and then "heapifying" it up the tree, which takes logarithmic time, O(log N), proportional to the height of the heap.

    Practice Next
    More IT Operating System Questions
    ask-question