CSC 216/s08/do right: Difference between revisions

Revision as of 22:08, 11 April 2008

Formatting Resources

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 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 search tree. Participate with the video by deciding how a binary search tree would look after adding or removing a node from the tree.

@@ Line 2: / Line 2: @@
 [http://meta.wikimedia.org/wiki/Help:Wikitext_examples Formatting Help Guide from MetaWiki]
-==Sorting with Binary Trees==
+==Learning how Binary Search Tree Works==
 ===The problem===
-Teaching the students how to sort in Binary Tree.
+Teaching the students how to insert and delete nodes from Binary Search Tree.
 <br>This includes:
 <br>How do we delete a node from a binary search tree?
@@ Line 21: / Line 21: @@
 ===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.
+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.