Tutorial_10_Sol-for-viewing-printing

Tutorial_10_Sol-for-viewing-printing - than 2, whereas...

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

View Full Document Right Arrow Icon
CC2203 Data Structures and Algorithms Sem 2, 2009-2010 Tutorial 10 Solution Exercise 1 answer: (a) (b) Prefix form: / * + 1 2 - 8 3 + 5 7 Postfix form: 1 2 + 8 3 - * 5 7 + / (c) Preorder (d) Postorder (e) s An arithmetic expression can be represented by a binary tree called expression tree. No node in a binary tree may have a degree more
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: than 2, whereas there is no limit on the degree of a node in a tree. s An expression tree may be empty; a tree cannot be empty. s The subtrees of an expression tree are ordered; those of a tree are not ordered. CC2203 Data Structures and Algorithms Sem 2, 2009-2010 (f)...
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_Sol-for-viewing-printing - than 2, whereas...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online