Which operation involves visiting each element of a data structure systematically?

Options

  • A. Traversal
  • B. Encryption
  • C. Compilation
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

A. Traversal

Detailed Explanation

Traversal means systematically visiting the elements of a data structure. For example, an array can be traversed from the first element to the last. In a linked list, traversal usually starts from the head and follows links until the end. Trees can be traversed using preorder, inorder, postorder, or level-order methods. Graphs commonly use BFS and DFS. Traversal is therefore a fundamental operation used to process or examine stored data.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts