Here you can find the source of treeNodeTest(DefaultMutableTreeNode n)
public static void treeNodeTest(DefaultMutableTreeNode n)
//package com.java2s; /*//from ww w. java 2 s .com JavaRAP: a freely-available JAVA anaphora resolution implementation of the classic Lappin and Leass (1994) paper: An Algorithm for Pronominal Anaphora Resolution. Computational Linguistics, 20(4), pp. 535-561. Copyright (C) 2005,2006 Long Qiu This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ import java.util.*; import javax.swing.tree.*; public class Main { public static void treeNodeTest(DefaultMutableTreeNode n) { Enumeration enumeration = n.breadthFirstEnumeration(); int count = 0; while (enumeration.hasMoreElements()) { DefaultMutableTreeNode node = (DefaultMutableTreeNode) enumeration.nextElement(); System.out.println(node.getDepth() + node.toString()); count++; } System.out.println(count + " nodes in total."); } }