Instead of building a logical binary tree, a so called reverse
polish notation gets built by dijkstras shunting yard algorithm.
This can easily be evaluated for every row using stacks.
Still in heavy development => no unit tests yet and still
a bit messy.