0 votes 0 votes What would be the time complexity for insertion and deletion in the heap implementation of priority queue Rishav kashyap asked Sep 15, 2017 Rishav kashyap 176 views answer comment Share Follow See 1 comment See all 1 1 comment reply Manu Thakur commented Sep 15, 2017 reply Follow Share O(logn) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes In it , getHighestPriority() can be implemented in O(1) time, insert() can be implemented in O(Logn) time and deleteHighestPriority() can also be implemented in O(Logn) time. Red_devil answered Sep 15, 2017 Red_devil comment Share Follow See all 0 reply Please log in or register to add a comment.
