Graph and Tree Traversal

Graph and Tree Traversal

15 Qs

quiz-placeholder

Similar activities

แบบทดสอบ "เครื่องมือ (Tools) ที่ใช้ในวงจร DMAIC"

แบบทดสอบ "เครื่องมือ (Tools) ที่ใช้ในวงจร DMAIC"

University

10 Qs

Contemporary Philippine Arts from the Region

Contemporary Philippine Arts from the Region

12th Grade

15 Qs

4th Qtr_Religion 5_Review Game 2

4th Qtr_Religion 5_Review Game 2

KG - University

10 Qs

Unit 1a Assessment Review

Unit 1a Assessment Review

12th Grade

17 Qs

G7 STEM Q1 Final Examination

G7 STEM Q1 Final Examination

KG - University

15 Qs

Ch. 3 Lessons 1-2 Vocab Quiz

Ch. 3 Lessons 1-2 Vocab Quiz

5th Grade

14 Qs

Graph and Tree Traversal

Graph and Tree Traversal

Assessment

Quiz

others

Practice Problem

Medium

Created by

Mark Gadsby

Used 21+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Media Image

What is shown in this diagram

Rooted Tree
Simple Graph
Weighted Graph
Tree

2.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Media Image

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

True
False

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Media Image

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

Breadth First Traversal

Standard Traversal

Depth First Traversal

Branch Traversal

4.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Media Image

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

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Media Image

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

Array

Stack

Queue

Linked List

6.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Media Image

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

7.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Media Image

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

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?