[Solved] In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

Q.	In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
A.	depth first
B.	breadth first
C.	with first
D.	depth limited
Answer» A. depth first

View all MCQs in: Data Structure (DS)

Discussion

Related Multiple Choice Questions

A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
In doubly linked lists, traversal can be performed?
To perform level-order traversal on a binary tree, which of the following data structure will be required?
A vertex of in-degree zero in a directed graph is called a/an
A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
A graph in which all vertices have equal degree is known as ____

Help us improve!

We want to make our service better for you. Please take a moment to fill out our survey.