🚀 go-pugleaf

In article <14245@lambda.UUCP> jlg@lambda.UUCP (Jim Giles) writes:
>I)   Recursive data types.
>        As an example, consider a possible declaration of a binary tree
>        data type (all examples are in a Fortran/C-ish syntax - that is,
>              y = btree{3,x,btree{4,null,null}}

Ok.  Now how do I write the declaration of a function that returns 
a pointer to the first sub-tree with the value four at its root
without winding up with an aliased value?  AND how do I do this
without using recursion?          -- Darren