First look at instructions where you find how to use this application. Then you can start using the application to the full. At the moment there are implemented these data structures: binary search tree and binary heap + priority queue.
A little of a theory you can get from pseudocode section. There are definitions of used data structures and explanation of the algorithms.
This is a first version of the application. I have a lot of good ideas how to improve it. I want make the draw area resizable, create more algorithms on more data structures (AVL tree, B-tree, etc.), list currently animating (sub)algorithm. However if you have some idea you can let me know.
You can download the whole web and use it offline.
Bachelor‘s final project
These web pages are part of my Bachelor‘s final project on CTU FIT. A topic was 'Web environment for algorithms on binary trees', my supervisor was Ing. Tomas Rehorek (author JSGL).