This is my attempt to implement Red-Black Trees, one of the simplest form of
self-balancing binary trees (right after AVL trees), 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 Red-Black trees
as modern browsers are, but it does work.