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

Related MCQs

• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be
• Graph traversal is different from a tree traversal, because
• 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?
• The data structure required for Breadth First Traversal on a graph is?
• What is the traversal strategy used in the binary tree?
• How many orders of traversal are applicable to a binary tree (In General)? 3
• For the tree below, write the pre-order traversal.
• For the tree below, write the post-order traversal.