Graph and Tree Traversal

What is shown in this diagram

• Rooted Tree
• Simple Graph
• Weighted Graph
• Tree

Is the statement "an in-order traversal always visits the nodes in ascending order" true or false?

• True
• False

A traversal method that explores as far as possible along each branch before backtracking

• Breadth First Traversal

• Standard Traversal

• Depth First Traversal

• Branch Traversal

A traversal that explores nodes closest to the start node before exploring nodes further away

• Breadth First Traversal
• Standard Traversal
• Depth First Traversal
• Branch Traversal

Which data structure is typically used to keep track of the nodes to visit in a BFS

• Array

• Stack

• Queue

• Linked List

Traversing a tree by visiting the root, traversing the left sub-tree, then the right sub-tree.

• In-Order
• Pre-Order
• Post-Order
• Special-Order

Traversing a tree by traversing the left sub-tree, visiting the root, then the right sub-tree.

• In-Order
• Pre-Order
• Post-Order
• Special-Order

Traversing the left sub-tree, then traversing the right sub-tree, then visiting the root

• In-Order

• Postal order

• Post-Order

• Special-Order

A Binary Tree is what exactly?

• A structure where each node can have only 1 child node

• A structure where each node can have up to 2 child nodes

• A structure where each node must have at least 2 child nodes

• A structure where each node can have only 4 child nodes

A technique for searching data by splitting datasets in half repeatedly until the data is found

• Binary Tree
• Quick Sort
• Dijjkstra's Shortest Path Algorithm
• Binary Search