>>i want to make a tree view with a simple way using prints....
>>
>>anyone can do for me an example?
>>
>>an example is the way that you see the messages here, in universal
>>thread....
>
>First you need a data structure to keep it in - a .dbf with a regular
>key, and another field with the other record's key. Now you have to
>write something recursive to fill in for the keys, and something
>recursive to read it and display indented (one level of indentation for
>each level of recursion). It's kind of tricky until you do it once.
>
>I've done that some seven years ago, it was used for documenting the
>app's menu tree. Later it got used for any btree search, but basically
>it still uses menu.dbf, which didn't change much over the years. Now I'm
>using the same engine to fill a treeview from (guess) menu.dbf :), but
>it seems treeview is not best of all, because it's a foreign tissue in
>VFP.
>
>The trick consists mainly of an array which keeps the location where you
>start next level of recursion (i.e. a node with children) from, so when
>you return, you know where you branched off. Could send you the code, if
>this sounds interesting enough.

yes, if u can... i think that will be enough

Thnks for reply.
Ariel Pablo Klein
Argentina