CS-Term2-Week4-Day5

In a ______________, each node will have up to two connected nodes.

• Binary Tree

• Bubble Sort

• Linear Search

• Queues

•A set of instructions or rules to follow step-by-step to solve a problem.

• ADT

• Algorithm

• Graph

• Stack

•A simple search algorithm that checks every element a list sequentially until it finds a match or exhaust the list.

• Binary Tree

• Bubble Sort

• Linear Search

• Queues

These connected nodes are called child nodes. Each parent node can have a left child node

and a right child node.

• Binary Tree

• Bubble Sort

• Linear Search

• Queues

•It can be represented in both flowchart or pseudocode.

• ADT

• Algorithm

• Graph

• Stack

It is possible to represent data in a ___________________ as a linked list of nodes.

• Binary Tree

• Bubble Sort

• Linear Search

• Queues

It is the most inefficient of the sorting algorithms but very easy to implement.

• Binary Tree

• Bubble Sort

• Linear Search

• Queues

•The target element in _______________________ is at the end of the list or not present; the algorithm will have to iterate through every element in the list.

• Binary Tree

• Bubble Sort

• Linear Search

• Queues

•A ______________ does not required sorted data

• Binary Tree

• Bubble Sort

• Linear Search

• Queues

•It sorts an unordered list of items.

• Binary Tree

• Bubble Sort

• Linear Search

• Queues