package huffman_tree;

public class HuffmanNode implements Comparable<HuffmanNode> {

	private char letter;
	private int freq;
	private int index;
	private int parent;
	private int right = -1;
	private int left = -1;
	private String bitArray;
	public static int nodeNum = 0;

	public HuffmanNode(char letter, int freq) {
		this.setLetter(letter);
		this.index = nodeNum++;
		this.freq = freq;
	}

	public HuffmanNode(char letter, int freq, int left, int right) {
		this.setLetter(letter);
		this.index = nodeNum++;
		this.freq = freq;
		this.right = right;
		this.left = left;
	}

	public int getFreq() {
		return freq;
	}

	public void setFreq(int freq) {
		this.freq = freq;
	}

	public int getIndex() {
		return index;
	}

	public void setIndex(int index) {
		this.index = index;
	}

	public int getParent() {
		return parent;
	}

	public void setParent(int parent) {
		this.parent = parent;
	}

	public String getBitArray() {
		return bitArray;
	}

	public void setBitArray(String bitArray) {
		this.bitArray = bitArray;
	}

	public int compareTo(HuffmanNode arg0) {
		// TODO Auto-generated method stub

		return (int) (this.getFreq() - arg0.getFreq());

	}

	public void setRight(int right) {
		this.right = right;
	}

	public int getRight() {
		return right;
	}

	public void set(int left) {
		this.left = left;
	}

	public int getLeft() {
		return left;
	}

	public void setLetter(char letter) {
		this.letter = letter;
	}

	public char getLetter() {
		return letter;
	}

}