Java实现简单树结构

package com.app;
 
 import java.util.ArrayList;
 import java.util.List;
 
 public class treeNode {
   public T t;
   private treeNode parent;
   
   public List> nodelist;
   
   public treeNode(T stype){
     t   = stype;
     parent = null;
     nodelist = new ArrayList>();
   }
 
   public treeNode getParent() {
     return parent;
   }  
 }

package com.app;
 
 public class tree {
   
   public treeNode root;
   
   public tree(){}
     
   public void addNode(treeNode node, T newNode){
     //增加根节点
     if(null == node){
       if(null == root){
         root = new treeNode(newNode);
       }
     }else{
         treeNode temp = new treeNode(newNode);
         node.nodelist.add(temp);
     }
   }
   
   /*  查找newNode这个节点 */
   public treeNode search(treeNode input, T newNode){
   
     treeNode temp = null;
     
     if(input.t.equals(newNode)){
       return input;
     }
     
     for(int i = 0; i  getNode(T newNode){
     return search(root, newNode);
   }
   
   public void showNode(treeNode node){
     if(null != node){
       //循环遍历node的节点
       System.out.println(node.t.toString());
       
       for(int i = 0; i 

package com.app;
 
 public class app {
 
   /**
    * @param args
 */
   public static void main(String[] args) {
     // TODO Auto-generated method stub
     /*简单实现一个树的结构，后续完善解析xml       */
     /*写得满烂的，后续查阅一些其他代码        2012-3-12  */
     //测试
     /*
     * string
     *     hello
     *       sinny
     *       fredric
     *     world
     *      Hi
     *      York
     * */
     
     tree tree = new tree();
     tree.addNode(null, "string");
     tree.addNode(tree.getNode("string"), "hello");
     tree.addNode(tree.getNode("string"), "world");
     tree.addNode(tree.getNode("hello"), "sinny");
     tree.addNode(tree.getNode("hello"), "fredric");
     tree.addNode(tree.getNode("world"), "Hi");
     tree.addNode(tree.getNode("world"), "York");
     tree.showNode(tree.root);
     
     System.out.println("end of the test");
   }
 
 }