wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Trees

Total questions: 10

Worksheet time: 2mins

Name
Class
Date
1.

A connected graph that contains no simple circuits.

a)

Stacks

b)

Queues

c)

Trees

d)

Graphs

2.

Trees were used as long ago in _____ when an English mathematician used them to count certain types of chemical compounds.

a)

1847

b)

1857

c)

1867

d)

1877

3.

A special type of binary tree where the value of the key of left child is lesser than its parent and the right child is greater than its parent.

a)

Binary Search Tree

b)

Binary Tree

c)

Tree Traversal

d)

Spanning Tree

4.

A _____ is a cycle where a single vertex begins and ends with itself.

a)

Loop

b)

Cycle

c)

Spiral

d)

Helix

5.

“C”, “L”, “U”, “B”

What will be the root in this Binary Tree?

a)

C

b)

L

c)

U

d)

B

6.

What is the value of the prefix expression: +  6 5 2+\ -\ 6\ 5\ 2

a)

9

b)

13

c)

4

d)

3

7.

What is the first step in Postorder Traversal?

a)

Visit the root node.

b)

Traverse the right subtree recursively

c)

Traverse the left subtree recursively

d)

None of the Choices

8.

The process of systematically visiting each node in a tree data structure

a)

Level Order Traversal Algorithms

b)

Traversal Algorithms

c)

In order Traversal

d)

Preorder Traversal

9.

A _____ is a path of at least 3 vertices that starts and ends with the same vertex.

a)

Loop

b)

Cycle

c)

Spiral

d)

Helix

10.

Who was the English mathematician who used trees to count certain types of chemical compounds.

a)

Arthur Cayley

b)

Arthur Nery

c)

Arthur Ceyley

d)

Arthur Kayley