The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

Consider the 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 expression tree corresponding to the reverse polish expression

3  4  *  5  –  2  ^  6  7  *  1  +  –

What will be expression, any procedure for it??

asked in Compiler Design by Veteran (114k points) | 41 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,434 questions
53,630 answers
70,898 users