0
Consider the following new-order strategy for traversing a given tree.
I. Visit the right subtree of a Node using new-order
II. Visit the Node
III. Visit the left subtree of a Node using new-order What is the new-order traversal of the given tree?
I. Visit the right subtree of a Node using new-order
II. Visit the Node
III. Visit the left subtree of a Node using new-order What is the new-order traversal of the given tree?

- AZ, V, Y, X, W, P, S, U, T, Q, R
- BR, Q, T, U, S, P, W, X, Y, V, Z
- CP, W, X, Y, V, Z, R, Q, T, U, S
- DS, U, T, Q, R, Z, V, Y, X, W, P
Correct answer: A