CSC 216/s08/do right: Difference between revisions
Jump to navigation
Jump to search
Chronomega1 (talk | contribs) |
Chronomega1 (talk | contribs) |
||
| Line 9: | Line 9: | ||
Teaching the students how to insert and delete nodes from Binary Search Tree. | Teaching the students how to insert and delete nodes from Binary Search Tree. | ||
<br>This includes: | <br>This includes: | ||
<br>How do we do insertion in a binary tree? | |||
<br>How do we delete a node from a binary search tree? | <br>How do we delete a node from a binary search tree? | ||
•If the node is a leaf node, then _______________? | •If the node is a leaf node, then _______________? | ||
•If the node has one child, modify ______________? | •If the node has one child, modify ______________? | ||
•If the node has two children, __________________? | •If the node has two children, __________________? | ||
===Participants and props=== | ===Participants and props=== | ||
Revision as of 02:00, 20 April 2008
Formatting Resources
Formatting Help Guide from MetaWiki
Learning how Binary Search Tree Works
The problem
Teaching the students how to insert and delete nodes from Binary Search Tree.
This includes:
How do we do insertion in a binary tree?
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, __________________?
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 search tree. Participate with the video by deciding how a binary search tree would look after adding or removing a node from the tree.