The data structure required for Breadth First Traversal on a graph is? – McqOptions

MCQOPTIONS

1.	The data structure required for Breadth First Traversal on a graph is?
A.	Stack
B.	Array
C.	Queue
D.	Tree
Answer» D. Tree

Discussion

No Comment Found

Related MCQs

Queues serve major role in ______________
A normal queue, if implemented using an array of size MAX_SIZE, gets full when?
A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?
If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
Circular Queue is also known as ________
A queue follows __________
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as _____________
In which of the following data structures, both insertion and deletion operations can take place at either end of the structure?
Consider a standard circular queue ‘q’ implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q[1], .... q[10]. The front and rear pointers are initialized to point at q[2]. In which position will the ninth element be added ?
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)?