That is currently correct, if you are working with code which causes side effects (such as I/O).
0 0$echo L:0 (1;2);3;<(4;5) 1 2 3 4 5 0 0$echo L:1 (1;2);3;<(4;5) +-+-+ |1|2| +-+-+ 3 +-+-+ |4|5| +-+-+ That said, approaches such as https://rosettacode.org/wiki/Tree_traversal#J might interest you. Thanks, -- Raul On Sun, May 10, 2020 at 7:41 PM Raoul Schorer <raoul.scho...@gmail.com> wrote: > > Hello, > > After experimenting myself, I am in doubt regarding the type of tree > traversal L: and S: provide. > > I am under the impression that the pattern is left pre-order traversal. > Is that right, though? > > Thanks for your help, > > Raoul > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
