Java tree data-structure?

Question

Is there a good available (standard Java) data structure to represent a tree in Java? Specifically I need to represent the following: - The tree at any node can have an arbitrary number of children - Each node (after the root) is just a String (whose children are also Strings) - I need to be able to get all the children (some sort of list or array of Strings) given an input string representing a given nodeIs there an available structure for this or do I need to create my own (if so implementation suggestions would be great).

Answer 1

It shall require a recursive class definition for TreeNode;

something like this:

class TreeNode

{

private TreeNode parent;

private [] TreeNode children;

};

Care must be taken on constructor so that an endless sequence

of recursive calls does not blow up the VM heap.