

MCQOPTIONS
Saved Bookmarks
1. |
Consider the following New-order strategy for traversing a binary tree: Visit the root; Visit the right subtree using New-order Visit the left subtree using New-order The New-order traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5 - 2 ˆ 6 7 * 1 + - is given by: |
A. | + - 1 6 7 * 2 ˆ 5 - 3 4 * |
B. | - + 1 * 6 7 ˆ 2 - 5 * 3 4 |
C. | - + 1 * 7 6 ˆ 2 - 5 * 4 3 |
D. | 1 7 6 * + 2 5 4 3 * - ˆ - |
Answer» D. 1 7 6 * + 2 5 4 3 * - ˆ - | |