Question: Topological sort is equivalent to which of the traversals in trees?

Options

A : Pre-order traversal

B : Post-order traversal

C : In-order traversal

D : Level-order traversal

Click to view Correct Answer

Previous || Next

Data Structure Topological Sorting more questions

Which of the following is not true regarding pre-heating of....

Which attack requires the least effort/computations?

What will happen if a G2 phase cell is fused....

Which of the following will best control contagious mastitis?

Depth First Search is equivalent to which of the traversal....

Breadth First Search is equivalent to which of the traversal....

The correct sequence for the procedure adopted for making a....

Which of the following statements is not related to toddy?

Which of the following invokes functions in sql?

Which option is not considered as the duty of quantity....

Data Structure Adjacency List more Online Exam Quiz

Data Structure Stack Operations

Data Structure Stack Using Queues

Data Structure String Reversal Recursion

Data Structure Test

Data Structure Threaded Binary Tree

Data Structure Towers Hanoi

Data Structure Undirected Graph

Data Structure Uniform Binary Search

Data Structure Wagner Fischer Algorithm

Data Structure Weak Heap