CSC 216/s08/make plans: Difference between revisions
Jump to navigation
Jump to search
| Line 7: | Line 7: | ||
Binary Trees are a new concept and it is important to have a solid understanding of binary trees before moving onto binary search trees. | Binary Trees are a new concept and it is important to have a solid understanding of binary trees before moving onto binary search trees. | ||
The problem is that we are given a row of letters and have no knowledge of how to order those letters. Likewise, we are given a row of numbers and asked to do the same thing. | |||
The | The object is to order the given list of letters and numbers in 3 ways: Preorder Traversal, Inorder Traversal, and Postorder Traversal. | ||
===Participants and props=== | ===Participants and props=== | ||
Revision as of 22:30, 15 April 2008
Formatting Resources
Formatting Help Guide from MetaWiki
Understanding Binary Trees
The problem
Binary Trees are a new concept and it is important to have a solid understanding of binary trees before moving onto binary search trees.
The problem is that we are given a row of letters and have no knowledge of how to order those letters. Likewise, we are given a row of numbers and asked to do the same thing.
The object is to order the given list of letters and numbers in 3 ways: Preorder Traversal, Inorder Traversal, and Postorder Traversal.
Participants and props
How many students will participate? What else do you need (e.g., old tennis ball, Powerpoint slides, software).
The script
Describe how to do your exercise.