Inorder, Preorder, and Postorder traversals can be accomplished using _____.
A) recursion
B) no pointers
C) no arguments
D) no parameters
E) None of these

Question

Quizplus · Accepted Answer

Recursion allows for easy traversal of trees using any of the three methods. Each traversal can be done by recursively calling the function on the left and right subtrees of a current node, either before, during, or after processing the current node. No pointers, arguments, or parameters are necessary for these traversals, but recursion provides a clean and concise solution.

Inorder, Preorder, and Postorder Traversals Can Be Accomplished Using _____