public void cargarArbol() {
        int count = 0;
        int aux = 1;
        int entre = 0;
        Enumeration e = root1.breadthFirstEnumeration();
        while (e.hasMoreElements()) {
            parent1 = (DefaultMutableTreeNode) e.nextElement();
            if (count >= aux) {
                CLS_ITEM_CONTA objChildren = (CLS_ITEM_CONTA) parent1.getUserObject();
                //consigo los hijos de idparent
                System.out.println(objChildren.Descripcion);
                vecChildren = clsConta.getChildrenC(objChildren.Id);
                for (int k = 0; k < vecChildren.size(); k++) {
                    CLS_ITEM_CONTA hijo = (CLS_ITEM_CONTA) vecChildren.get(k);
                    //hijo.setDescrip(hijo.getCodigo_PC()+"-"+hijo.getNombre_C());
                    System.out.println("        -> "+hijo.Descripcion);
                    childnode = new DefaultMutableTreeNode(hijo);
                    modelo1.insertNodeInto(childnode, parent1, parent1.getChildCount());
                }
            }
            //Pregunto si llego al fin.
            if (e.hasMoreElements() == false) {
                
                int toEle = totalElementos(root1.breadthFirstEnumeration());
                System.out.println(">>> ENTRE EN HASMORE toEle: "+toEle+" bcount: "+bcount+" count: "+count);
                if (bcount < toEle) {
                    System.out.println("-----------------");
                    if (entre==0){
                        aux = count;
                        count = -2;
                        entre+=1;
                    }
                    else{
                        aux = count+1;
                        count = -2;
                    }
                    e = root1.breadthFirstEnumeration();
                    bcount = toEle;
                } else {
//                     JOptionPane.showMessageDialog(this, "Ya no hay mas hijos");
                    break;
                }
            }
            count++;
        }

    }