key term - Traversal

Definition

Traversal refers to the process of visiting and accessing each element in a data structure, such as an array or a tree, in a specific order.

Related terms

Preorder traversal: A type of traversal where the root node is visited first, followed by its left subtree and then its right subtree.

Inorder traversal: A type of traversal where the left subtree is visited first, followed by the root node and then the right subtree.

Postorder traversal: A type of traversal where the left subtree is visited first, followed by the right subtree and then finally the root node.