Virtual Manipulative -- BST search
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Max Hailperin |
||||
Institution |
Gustavus Adolphus College |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Shows in detail how to insert into a BST, using a display based on "opening nested boxes" when a given branch is followed. |
||||
Evaluation |
This AV has some interesting ideas. A good aspect is that it shows in some detail how search is done in a BST, from the "point of view" of the algorithm working through the tree. This is in contrast to standing back and seeing pointers moving through the tree. It might help students see this in a new perspective. It is also good in that it focuses on how the find algorithm works, rather than just seeing the result. The main downside is that it doesn't do anything more than find, which is generally not a difficult concept for students. It would not be a big step to extend this to insert. All that would be needed is to have the inserted value sit below the tree area, and the user can move it into the appropriate box (empty leaf node) when it becomes available. I don't see immediately how this could be extended to deletion, which is what students really have trouble with. |
||||
Random Data; Step Control |
|||||
Teaching the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-03-17 |
||||
Last Visited |
2009-04-28 |
||||
Last Updated |
1999 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
