This week's book giveaway is in the OO, Patterns, UML and Refactoring forum. We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line! See this thread for details.
I am storing a tree structure in a database (two fields, basically one identifying �this� node and one identifying its parent). I can not be sure of how the data will be returned to me. Is there a way to convert a vector to a jtree easily? I am guessing no but I thought I would ask. If not then please check this logic 1.Read through the vector and look for �ROOT� 2.remove Root and set it as Root in tree 3.look for �first child� of Root 4.add �first child� 5.look for child of �first child��continue on until no more children of children 6.go up one level and look for �second child��follow same logic It seems reasonable but, I have no experience with Jtrees and I am having a heck of a time putting the steps into code. Any ideas?