Recursively visiting the left subtree,right subtree and then the root describes:
A)preordering processing
B)inorder processing
C)postorder processing
D)none of the above

Question

Quizplus · Accepted Answer

Recursively visiting the left subtree, then the right subtree and finally the root is called postorder processing. This is because we first process (visit) the left subtree, then the right subtree and finally the root node, similar to how we would read a post-order traversal of the tree.

Recursively Visiting the Left Subtree,right Subtree and Then the Root