Datastructures | Tree-Traversals | The Inquisitive

Datastructures - Tree Traversals

page 1 out of 3

page 1 out of 3

Question 1

What is Level order traversal equal to?

A

B

C

Pre order traversal

D

In order Traversal

Question 2

Which of the following is not a tree traversal?

A

Inorder Traversal

B

Pre order Traversal

C

Level order traversal

D

Question 3

What does the following code snippet do?

A

B

C

D

Question 4

What is Depth First Search equals to?

A

Pre order Traversal

B

In order Traversal

C

Post order Traversal

D

Level order Traversal

Question 5

What is common in three different types of traversals (Inorder, Preorder and Postorder)?

A

Root is visited after left subtree

B

Root is visited before right subtree

C

Left subtree is always visited before right subtree

D

All of the above

E

None of the above

Question 6

Which of the following pairs of traversals is not sufficient to build a binary tree from the given traversals?

A

Inorder and Postorder

B

Preorder and Inorder

C

Preorder and Postorder

D

None of the Above

Question 7

The inorder and preorder traversal of a binary tree are 40 20 50 10 60 30 70 and 10 20 40 50 30 60 70, respectively. The postorder traversal of the binary tree is:

A

50 40 20 60 70 30 10

B

40 50 20 60 70 30 10

C

50 40 20 70 60 30 10

D

40 50 60 70 20 30 10

Question 8

It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given.

A

B

Question 9

What is the inorder Traversal of this Tree?

A

3 5 8 12 20 24 37 58 60 62 91

B

37 12 5 3 20 24 62 58 60 91

C

3 8 5 24 20 12 60 58 62 91 37

D

37 12 62 5 20 58 91 3 8 24 60

Question 10

What is the pre order Traversal of this Tree?

A

3 5 8 12 20 24 37 58 60 62 91

B

37 12 5 3 20 24 62 58 60 91

C

3 8 5 24 20 12 60 58 62 91 37

D

37 12 62 5 20 58 91 3 8 24 60

page 1 out of 3

page 1 out of 3

Sign Up Page

Sign In Sign Up

Forgot Password

{{ nameValue }}

{{ emailValue }}

{{ passValue }}

{{ confValue }}

Password must be strong.Eg:@TheInquisitive123

Oops!!

To view the solution need to Login

Score : 0 / 0

L

o

a

d

i

n

g

.

.

.