Data Structures (3130702) MCQs

MCQs of Tree Part-2

Showing 1 to 5 out of 5 Questions
1.

Sequential representation of binary tree uses ........

(a)

Array with pointers
(b)

Single linear array
(c)

Two dimentional arrays
(d)

Three dimentional arrays
Answer:

Option (a)

2.

Which indicates pre-order traversal?

(a)

Left sub-tree, Right sub-tree and root
(b)

Right sub-tree, Left sub-tree and root
(c)

Root, Left sub-tree, Right sub-tree
(d)

Right sub-tree, root, Left sub-tree
Answer:

Option (c)

3.

In threaded binary tree ......... points to higher nodes in tree.

(a)

Info
(b)

Root
(c)

Threads
(d)

Child
Answer:

Option (c)

4.

Which of the following statements about binary trees is NOT true?

(a)

Every binary tree has at least one node.
(b)

Every non-empty tree has exactly one root node.
(c)

Every node has at most two children.
(d)

Every non-root node has exactly one parent.
Answer:

Option (a)

5.

If the two tree traversals are:

1) Inorder: DGBAHEICF

2) postorder: GDBHIEFCA

 

then the preorder tree traversal can be…

(a)

A-B-D-G-C-E-H-I-F
(b)

A-B-G-D-E-C-H-I-F
(c)

B-A-D-G-C-E-H-I-F
(d)

A-B-D-G-C-E-H-F-I
Answer:

Option (a)

Showing 1 to 5 out of 5 Questions