(in honor of Reverse Polish Notation, Odwrotna Notacja Polska).

(anecdote: in Computer Sciences, trees grow with root upwards).

Design:

* Adaptable Data Structure, with operations that do not overuse resources,

* Minimalistic,

* For storing Arithmetic Expressions, accepts input in Reverse Polish Notation.

it should

*'cut out'*unneccessary subtrees as needed, for example if multiplied by 0. for that it should store subexpression result values at proper subtree nodes.

TODO: implementations (in Ansi C language and in Stitie Space, Java, Google Go, perhaps more.... in this order.).

Downloads:

* Ansi C implementation, without concurrency support, unfinished.

(PL) : 'bo nie bez korzeni... i żeby rosły do ziemii'. ;)

ReplyDelete