This preview shows pages 1–11. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: b Proceeds as far as possible to the left then backs up until the first crossroad, goes one step to the right, and again as far as possible to the left b This process is repeated until all nodes are visited b This definition does not specify exactly when nodes are visited: before proceeding down the tree or after backing up? s Preorder traversal s Inorder traversal s Postorder traversal Inorder Traversal b Left child, parent node, right child (DONE IN CLASS) Inorder Traversal (contd) Preorder Traversal b Parent node, left child, right child (DONE IN CLASS) Postorder Traversal b Left child, right child, parent node (DONE IN CLASS)...
View
Full
Document
This note was uploaded on 11/26/2009 for the course MATH AND C CSCI255 taught by Professor Dr.ikergondraluja during the Spring '09 term at St. Francis Xavier, Antigonish.
 Spring '09
 Dr.IkerGondraLuja

Click to edit the document details