Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Tree traversals

Traversals

Report a typo

On the left are a list of tree traversals, and on the right, you'll find their corresponding descriptions. Your task is to correctly match each tree traversal with its corresponding description.

Match the items from left and right columns

Pre-order

In-order

Post-order

Level-order

Visit the left child of the current node (if exists), after that, visit the right child of the current node (if exists), then, visit the current node.

Visit the current node, then, visit the left child (if exists), next, visit the right child (if exists).

Visit the left child of the current node (if exists), next, visit the current node, after that, visit the right child of the current node (if exists).

Visit a root, after that, visit all nodes that are at a distance of one from the root, next, we visit the nodes that are at a distance of two from the root and so on.

___

Create a free account to access the full topic