GATEverse Practice, past papers & mock tests
GATE 2015 · Set-1
Programming & Data StructuresTreesmediumMCQ2 marks
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:
Save your progress

Related Programming & Data Structures PYQs