The inset below illustrates the behaviour of binary search trees. The Art of Computer Programming”: Red binary option and Sorting Algorithms. A diochromatic framework for balanced trees. 2002Insert and Delete animations have been enhanced with better visuals for the Split and Join operations on splay trees.
For example, you do not have to wait for the current Insert animation to be completed in order to insert the next key. A series of fast Inserts will quickly build a large tree with pseudo-random keys. All AVL and Splay methods used in the applet have been posted. I was able to reproduce the problem on a Redhat 7.
Monge from Cal State successfully tested the applet with Mozilla 1. More snippets of the source code posted. The Thinker does a much better job now. If two rotations are pending, the numbers on the top of the flashing arrows will indicate the rotation order. Decreasing the animation speed will make the “thinking” pause longer. If you get impatient, click anywhere on the panel to proceed to the next iteration.