node.java

数据结构二叉树

public class Node
{
   private Node left;
   private Node right;
   private Node father;
   private String character;
   
   public Node()
   {
     left=null;
     right=null;
     father=null;
     character="0";
    }
    public void setLeft(Node Left)
    {
       left=Left;   
    }
    
    public void setRight(Node Right)
    {
        right=Right;
    }
    
    public void setFather(Node Father)
    {
        father=Father;
    }
    
    public void setData(String str)
    {
     character=str;   
    }
    
    public Node getLeft()
    {
     return left;   
    }
    
    public Node getRight()
    {
     return right;   
    }
    
    public Node getFather()
    {
     return father;   
    }
    
    public String getData()
    {
     return character;   
    }

}