Binary Tree Traversal, Part 1

In the last post, we discussed how binary trees are created in PicoLisp. Now let's play a little more with them. See the following task from the Rosetta Code: Task Implement a binary tree where each node carries an integer, and implement: pre-order...