QUESTION 5 Which of the following data structures is the best for implementing the priority queue? binary heap bineary s

[answerhappygod]

Question 5 Which Of The Following Data Structures Is The Best For Implementing The Priority Queue Binary Heap Bineary S 1 (22.47 KiB) Viewed 38 times

QUESTION 5 Which of the following data structures is the best for implementing the priority queue? binary heap bineary search tree sorted array hash table QUESTION 6 Which of the following sorting algorithms is the fastest if the input is almost sorted? quick sort bubble sort merge sort insertion sort QUESTION 7 Given a linked list: 1->2->3->4->5->NULL and head pointing to first node 1. What is the result of linked list pointed by head after the following operation? head->next-head->next->next->next; 5->NULL O 1->->->NULL 4-5->NULL O 1->5->NULL