CSC 216/s08/be gentle: Difference between revisions
| Line 5: | Line 5: | ||
===The problem=== | ===The problem=== | ||
The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees. | The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees. | ||
===Participants and props=== | ===Participants and props=== | ||
The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each. | The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each. | ||
===The script=== | ===The script=== | ||
The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list. Once the professor says "go," the other members of each group can flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game. | The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list. Once the professor says "go," the other members of each group can flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game. | ||
Revision as of 20:33, 13 April 2008
Binary Speed Tree
The problem
The concept of binary search trees in Java is one that can be difficult to grasp. The goal of this exercise is to help students visualize how a binary search tree is created. It does this by actively involving them in sorting their own search tree using a deck of cards. By seeing how a random set of numbers are placed into a tree, students will better understand how binary search trees are sorted and be given a visual example of the efficiency of these trees.
Participants and props
The only prop required for this exercise will be a single deck of cards. The participants will be four teams of about five students each.
The script
The deck of cards will be split into the four different suits (hearts, spades, clubs, diamonds) and the face cards, as well as the aces will be removed from the deck. The participants will be divided into four teams, one for each suit. Each member of the group will receive one card from their pile face down, so they cannot see the value of the card. Each team will select a team leader who will show their card. This card will represent the first card in the binary search tree, and the leader will stand at the top of the list. Once the professor says "go," the other members of each group can flip over their card. The group will then decided the best way to organize themselves in a correct binary search tree by standing in the correct corresponding position to the preceding cards. Once they believe they have the tree sorted correctly, the leader yells "finished," and the professor will check to make sure the group has sorted themselves correctly. The first group to finish and be checked for correctness wins the game.