Re: Combinations Dispositions Permutations TREE

*To*: mathgroup at smc.vnet.net*Subject*: [mg108853] Re: Combinations Dispositions Permutations TREE*From*: Lele <emanuele.tormene at gmail.com>*Date*: Sun, 4 Apr 2010 07:44:47 -0400 (EDT)*References*: <hopuvn$r67$1@smc.vnet.net>

Thanks!!! Could you help me with the second question? > > 2) I would like to write a function able to draw a tree representing > > the path going through every k-th step of "fishing" into the list (for > > every function). > > For example, given the l={a,b,c} , k=2, I would like to draw a > > DispositionTree[l,k] > > > a -- b > > / \ c > > / > > --b -- a > > \ \ c > > \ > > c -- a > > \ b > > > Thanks, Lele (I am sorry for my english, my code and my ignorance)