Give your most concise answer to the following questions:

- What is a priority queue? When would you use a priority queue?

- What are the runtimes of deleteMin and insert if we use a LinkedList to implement a priority queue and why?

- What are the runtimes of deleteMin and insert if we use a array as the underlying data structure to abstract a binary heap in the form of a complete tree?

- How does a binary heap differ from a Binary Search Tree?

- what is a complete tree, binary search tree, binary tree, perfect tree and differences/similiarites between these trees

- How can we implement the binary heap with an array -- using the array, where does a nodes parent and children reside (how to calculate it) - explain the 2 properties of the priority queue (structure and heap order)