Chapter 12 - Graph and Tree Traversal

Question 1

What is implementation?

Answer 1

Creating code to produce a programmed solution.

Question 2

What is an array?

Answer 2

A set of data items of the same grouped together with the same identifier.

Question 3

What are the two ways of traversing a graph?

Answer 3

Depth first or Breadth first.

Question 4

How do you traverse a graph depth first?

Answer 4

A method for traversing a graph that starts at chosen node and explores as far as possible along each branch away from the starting node before backtracking to visit unvisited nodes.

Question 5

How do you traverse a graph breadth first?

Answer 5

A method for traversing a graph that explores nodes closest to the starting node first before progressively exploring nodes that are further away. A queue is used to keep track of the nodes to visit.

Question 6

What is a queue?

Answer 6

A data structure where the first item added is the first item removed.

Question 7

What is pre-order?

Answer 7

A method traversing a tree by visiting the root, traversing the left subtree and traversing the right subtree.

Question 8

What is in-order?

Answer 8

A method of traversing a tree by traversing the left subtree, visiting the root and traversing the right subtree.

Question 9

What is post-order?

Answer 9

A method of traversing a tree by traversing the left subtree, traversing the right subtree and visiting the root.

Question 10

What is binary search?

Answer 10

A technique for searching data that works by splitting datasets in half repeatedly until the search data is found.

Question 11

Define recursion.

Answer 11

A technique where a function can call itself in order to complete a task.