AVL Trees

This is my attempt to implement AVL trees, the simplest form of self-balancing binary trees, in the AEC programming language. Just a few days ago, I implemented it in JavaScript.
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 AVL trees as modern browsers are, but it does work.








AEC program graphics output:
AEC program console output:

You can see the syntax-highlighted AEC source code (most of it is AI-generated).

UPDATE: I've also made a visualization of the red-black trees in AEC.