Tutorial_10_v02-for-viewing-printing

Tutorial_10_v02-for-viewing-printing - (f Figure 1 shows...

This preview shows pages 1–2. Sign up to view the full content.

CC2203 Data Structures and Algorithms Sem 2, 2009-2010 Tutorial 10 Instruction In this tutorial, you are required to submit your tutorial work answer for the exercises to me. Tutorial work will not be graded unless your coursework fails (coursework below D grade). If one’s coursework fails, that tutorial work will be graded to see if condone pass should be issued or not. Exercise 1 For the expression (1 + 2) * (8 – 3) / (5 + 7) (a) Draw the expression tree (b) Give prefix and postfix forms of the expression (c) Which tree traversal method gives prefix form of expression? (d) Which tree traversal method gives postfix form of expression? (e) What are the differences between an expression tree and a tree?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (f) Figure 1 shows the first three operations of postfix evaluation using stack data structure for scanning the postfix expression obtained in part (b) of this question. Figure 1 Show the rest operations of postfix evaluation using stack for the postfix expression obtained in part (b) of this question. CC2203 Data Structures and Algorithms Sem 2, 2009-2010 Review 1. Double-click bookprog.zip to extract bookprog folder. The bookprog folder contains all Java codes presented in the lectures. 2. Read the corresponding lecture slides ( Lecture Notes 11) for the compilation and execution. Understand those Java source codes, compile and execute them....
View Full Document

This note was uploaded on 08/18/2011 for the course COMP 3868 taught by Professor Keithchan during the Summer '97 term at Hong Kong Polytechnic University.

Page1 / 2

Tutorial_10_v02-for-viewing-printing - (f Figure 1 shows...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online