Auckland - Optimal Binary Search Tree
Recommendation |
Has Potential |
||||
Link |
http://www.cs.auckland.ac.nz/software/AlgAnim/opt_bin.html#opt_bin_anim |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Woi Ang; John Morris |
||||
Institution |
University of Auckland |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Applet which purports to teach about optimal binary trees; hard to learn algorithm from this visualization. It looks a little like the concept behind a huffman coding tree, but using something like dynamic programming to rearrange the nodes. The goal seems to be to 'order' the nodes by frequency to get the optimal search cost in terms of number of accesses to find the key values. |
||||
Evaluation |
Strengths: animated; simple UI. Weaknesses: unclear what is being demonstrated just from the visualization--would require explanation from instructor or accompanying webpage. There is an accompanying web page, which helps, but its not enough to make a lot of sense of this. |
||||
|
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-08-01 |
||||
Last Visited |
2008-07-17 |
||||
Last Updated |
1998 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
