Simple implementation of a tree structure, very imperfect! Follow with reference to the implementation of some other code.

Trying to implement a leaf with variable nodes that can be used to parse xml files.

Leaf code:

package com.app;

 import java.util.ArrayList;
 import java.util.List;

 public class treeNode<T> {
   public T t;
   private treeNode<T> parent;

   public List<treeNode<T>> nodelist;

   public treeNode(T stype){
     t   = stype;
     parent = null;
     nodelist = new ArrayList<treeNode<T>>();
   }

   public treeNode<T> getParent() {
     return parent;
   }
 }

Tree code:

package com.app;

 public class tree<T> {

   public treeNode<T> root;

   public tree(){}

   public void addNode(treeNode<T> node, T newNode){
     // Add the root node
     if(null == node){
       if(null == root){
         root = new treeNode(newNode);
       }
     }else{
         treeNode<T> temp = new treeNode(newNode);
         node.nodelist.add(temp);
     }
   }

   /*   To find the newNode This node  */
   public treeNode<T> search(treeNode<T> input, T newNode){

     treeNode<T> temp = null;

     if(input.t.equals(newNode)){
       return input;
     }

     for(int i = 0; i < input.nodelist.size(); i++){

       temp = search(input.nodelist.get(i), newNode);

       if(null != temp){
         break;
       }
     }

     return temp;
   }

   public treeNode<T> getNode(T newNode){
     return search(root, newNode);
   }

   public void showNode(treeNode<T> node){
     if(null != node){
       // To iterate over node The nodes of the
       System.out.println(node.t.toString());

       for(int i = 0; i < node.nodelist.size(); i++){
         showNode(node.nodelist.get(i));
       }
     }
   }
 }

Main function of the test:

package com.app;

 public class app {

   /**
    * @param args
 */
   public static void main(String[] args) {
     // TODO Auto-generated method stub
     /* Simple implementation 1 The structure of the tree was further improved and analyzed xml       */
     /* If it's badly written, check it later 1 Some other code         2012-3-12  */
     // test
     /*
     * string
     *     hello
     *       sinny
     *       fredric
     *     world
     *      Hi
     *      York
     * */

     tree<String> 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");
   }

 }