Midterm Review

Question 1

What is a binary search tree?

Answer 1

A node based data structure. Looks a bit like a flow chart, except the bigger numbers are usually on the right side.

Question 2

How is a binary search function done?

Answer 2

Usually by a recursive function. If the root node key is null, then what we are looking for does not exist.

Question 3

How is binary insertion done?

Answer 3

We do the same thing as a search function, except if a node is null, there are loops to determine which node the data goes to.

Question 4

How is binary deletion done?

Answer 4

If there is a node with no children, it’s simply removed. If there is a node with one child, the node is deleted and replaced with its child. If there is a node with two children, delete it base upon its children

Question 5

What is a heap?

Answer 5

It is a set of data that is placed in an array

Question 6

How is heap sort done?

Answer 6

The information is moved to a sorted and unsorted region of the array.