Data Structures (3130702) MCQs

MCQs of Tree Part-1

Showing 1 to 6 out of 6 Questions
1.

Binary trees with threads are called as .......

(a)

Threaded trees

 
(b)

Pointer trees
(c)

Special trees
(d)

Special pointer trees
Answer:

Option (a)

2.

In Binary trees nodes with no successor are called ......

(a)

End nodes
(b)

Terminal nodes
(c)

Final nodes
(d)

Last nodes
Answer:

Option (b)

3.

Every node N in a binary tree T except the root has a unique parent called the ......... of N.

(a)

Antecedents
(b)

Predecessor
(c)

Forerunner
(d)

Precursor
Answer:

Option (b)

4.

If the out-degree of each and every node is exactly equal to 2 or 0 and their number of nodes at level i is  2i-1 then the tree is called .......

(a)

complete binary tree
(b)

binary search tree
(c)

extended binary tree
(d)

data structure
Answer:

Option (a)

5.

A terminal node in a binary tree is called ............

(a)

Root
(b)

Leaf
(c)

Child
(d)

Branch
Answer:

Option (b)

6.

In a tree between every pair of vertices there is ?

(a)

Exactly one path
(b)

A self loop
(c)

Two circuits
(d)

n number of paths
Answer:

Option (a)

Showing 1 to 6 out of 6 Questions