2007/12/4, Dan Bron <[EMAIL PROTECTED]>: [snip] > BTW, Devon has written up a nice summary of trees as Ken presented them in > "A Programming Language". See here: > > http://www.jsoftware.com/jwiki/DevonMcCormick/APLTree > [snip]
Thanks, but I can't get it. Could anyone elaborate on the full left list matrix? I can understand the node ordering of full right list, but not the full left list. I think, if taken depth first search, the ordering of nodes should be n1, n2, n3, n5, n6, n8, n7, n4 and so on(not n1, n2, n3, n4, and so on). June ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
