CSC 216/s08/do right: Difference between revisions
Jump to navigation
Jump to search
Chronomega1 (talk | contribs) |
Chronomega1 (talk | contribs) |
||
| Line 4: | Line 4: | ||
==Sorting with Binary Trees== | ==Sorting with Binary Trees== | ||
===The problem=== | ===The problem=== | ||
Revision as of 20:22, 10 April 2008
Formatting Resources
Formatting Help Guide from MetaWiki
Sorting with Binary Trees
The problem
Teaching the students how to sort in Binary Tree.
This includes:
How do we delete a node from a binary search tree?
•If the node is a leaf node, then ______________? •If the node has one child, modify ______________? •If the node has two children, ______________?
How do we do insertion in a binary tree?
Participants and props
Students can do this on their individual computers or on in groups. Only thing that is needed from the users computer is flash loaded on it.
The script
Watch an interactive flash video insert and remove nodes from a binary tree. Participate with the video by deciding how a binary tree would look after adding or removing a node from the tree.