Topological order of a tree (where all the edges are directed from parent to child) is the same as ___ traversal of the tree.

Topological sort is equivalent to which of the traversals in trees?Marks : 1Negative Marks : 0Answer hereIn-order traversalPost-order traversalPre-order traversalLevel-order traversal

What is in-order traversal?left subtree is visited first, then the right subtree and finally the root nodethe root node is visited first, then the left subtree and finally the right subtreethe left subtree is visited first, then the root and later the right sub-tree

A level-order traversal of a tree is also known as a breadth-first traversal.Group of answer choicesTrueFalse

In an inorder traversal, the elements of a tree are visited in order of their distance from the root. A. True B. False

Explain Tree Topology