node.java.bak

用二叉树实现统计字符出现频率算法 JAVA实现

//定义树结点类

class Node
{
	private char c;
	private int count;
	private Node left;
	private Node right;

	public Node( char k )
	{
		c = k;
		count = 1;
		left = null;
		right = null;
	}

	public void addCount()
	{
		count++;
	}

	public void setLeft( Node n )
	{
		left = n;
	}

	public Node getLeft()
	{
		return left;
	}

	public void setRight( Node n )
	{
		right = n;
	}

	public Node getRight()
	{
		return right;
	}

	public int  getCount( )
	{
		return count; 
	}

	public char getChar()
	{
		return c;
	}

	public void setChar( char k )
	{
		c = k;
	}
		
}