Identify the correct definition of In-order traversal.
- A. A method of visiting all nodes of a tree by processing the left subtree, then the node, then the right subtree. ✓
- B. A way of representing a graph where each vertex stores a list of its neighboring vertices.
- C. A situation in a hash table where two different keys produce the same hash value.
- D. A node structure that contains a pointer or reference to another node of the same type, forming the basis of linked structures.
Correct answer
A. A method of visiting all nodes of a tree by processing the left subtree, then the node, then the right subtree.
Explanation
In-order traversal refers to a method of visiting all nodes of a tree by processing the left subtree, then the node, then the right subtree.