A ________ is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node.

_______programming is a method of solving complex problems by breaking them down into simpler steps.

 The four most common are probably line graphs, bar graphs and histograms, pie charts, and ?

Heap is called a ___________.

A graph consists of a set of nodes or vertices together with a set of edges or arcs where each edge joins two ______.

A _______ queue acts like a queue in that you dequeue an item by removing it from the front.

Sorting is the process of arranging objects in a certain sequence or order according to specific rules.

_________ algorithms work by recursively constructing a set of objects from the smallest possible constituent parts.

_____matrix in graph theory is a matrix sized n*n , where n is the number of vertices of the graph.

The _______ algorithm is a graph search algorithm that finds the shortest path between a given source vertex and all other vertices in the graph.