Get the current expended nodes in a Jtree

Question

hi
I would like to get the edges (the last node that is expened) in the expended tree paths
I tryied to do it with this function:
public Vector getExpandedPathsLastChild() {
        Enumeration expanded = null;
        //tree.getExpandedDescendants(getRootPath());
        int numOfChildren;
         int numOfGrandChildren;
         Vector paths = new Vector();
        Object obj;
        int j;
        BaseNode rootNode = (BaseNode) treeModel.getRoot();
        BaseNode currentNode;
        BaseNode currentGrandChild;
        if (rootNode != null) {
            numOfChildren = rootNode.getChildCount();
            for (int i = 0; i < numOfChildren; i++) {
                currentNode = (BaseNode) rootNode.getChildAt(i);
                System.out.println(" i= " + i + " currentNode" + currentNode.toString());
               numOfGrandChildren = currentNode.getChildCount();
                for(j=0;j<numOfGrandChildren;j++){
                    currentGrandChild = (BaseNode) currentNode.getChildAt(j);
                    expanded = getExpandedDescendants(currentGrandChild.getPathToRoot());
                    System.out.println(" j = " + j + " currentGrandChild" + currentGrandChild.toString());
                    if (expanded != null) {
                        while (expanded.hasMoreElements()) {
                            TreePath currPath = (TreePath) expanded.nextElement();
                            obj = currPath.getLastPathComponent();
                            System.out.println("obj is: "+ obj.toString());
                            paths.add(obj);
                    else{
                        if(isExpanded(currentGrandChild.getPathToRoot())){
                            paths.add(currentGrandChild);
        return paths;
    }but i see that i miss part of the nodes.
My tree model has a node that is not displayed this is why i am wotking with the "grand children" (otherwise i only get a small part of the expended nodes)
thanks
Liat

Answer 1

Use recursion. Make a method which has parameters of treenode and vector. It will look through all the children of that node and if they have children, it will call itself with that child and the same vector, else it will add to the vector.