Menu

Question Discussion & Solution

MCQ

Q.

When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

A

FAEKCDBHG

B

FAEKCDHGB

C

EAFKHDCBG

D

FEAKDCHBG

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Cartesian trees solve range minimum query problem in constant time

A

1

C

May be

D

Can't say

Discussion

MCQ

2.

Why to prefer splay trees?

A

easier to program

B

space efficiency

C

easier to program and faster access to recently accessed items

D

quick searching

Discussion

MCQ

3.

A full binary tree with 2n+1 nodes contain

A

n leaf nodes

B

n non-leaf nodes

C

n-1 leaf nodes

D

n-1 non-leaf nodes

Discussion

MCQ

4.

What is the advantage of using a dynamic set in direct addressing?

A

It saves time

B

It saves space

C

It saves both time and space

D

None of the mentioned

Discussion

MCQ

5.

How many nodes are there in a full state space tree with n = 6?

A

65

B

64

C

63

D

32

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs