Main Data Structures

Question 1

Breadth First Traversal

Answer 1

The method of traversing a graph by using a queue to visit all of the neighbours of the current node before doing the same to each of the neighbours until the entire graph has been explored

Question 2

Breadth Evaluation

Answer 2

• More efficient when the data searched for is closer to the root
• Better time complexity

Question 3

Depth First Traversal

Answer 3

The method of traversing a graph by using a stack to travel as far along one route as possible and then backtracking and doing the same for the remaining routes until the entire graph has been explored

(Right side of the blocks) - Cheat code

Question 4

Depth Evaluation

Answer 4

• More efficient when the data searched for is further down
• Can be written recursively to aid understanding
• Memory requirement is linear