Splay Trees

This is my attempt to implement Splay Trees, a binary tree structure optimized for fast retrieval of recently accessed nodes, in the AEC programming language.
This program uses WebAssembly, but, as far as I know, works in all browsers which support WebAssembly, including Firefox 52. If you are running this program in Firefox 52 (the last version of Firefox to run on Windows XP), go to about:config and then set the javascript.wasm option to true (it is false by default). It will not be as fast for large Splay trees as modern browsers are, but it does work.

Number to be inserted, deleted, or searched:

Insert
Delete
Seach
Insert as in Binary Search Tree (use this per the BFS algorithm to construct an already-known tree)

AEC program graphics output:

AEC program console output:

You can see the syntax-highlighted AEC source code.