m7 - Lecture C7: Trees Response to 'Muddiest Part of the...

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

View Full Document Right Arrow Icon
Lecture C7: Trees Response to 'Muddiest Part of the Lecture Cards' (8 respondents) 1) Are there traversal algorithms for evaluating non-binary (m-ary) trees ? Yes there are. The traversal algorithms (Preorder, postorder, and inorder) shown in class all operated on binary trees. For general trees (including m-ary trees), the traversal algorithms are defined with meanings similar to their binary tree counterparts: The preorder traversal of a general tree, first visits the root of the tree, then performs a preorder traversal of each subtree from left to right. The postorder traversal of a general tree, first traverse the root’s subtrees from left to right and then visit the root. The Inorder traversal of a general tree does not have a natural definition. You can make up an arbitrary definition, e.g., visit the leftmost subtree in inorder ,then the root, then visit the remaining subtrees in inorder. However, inorder traversal is usually not used for general trees. 2)
Background image of page 1

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

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

This note was uploaded on 01/28/2012 for the course AERO 16.01 taught by Professor Markdrela during the Fall '05 term at MIT.

Page1 / 2

m7 - Lecture C7: Trees Response to 'Muddiest Part of the...

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