public void start() {
		list = new ArrayList<BinaryTree>();
		BinaryTree z = null;
		this.count = 0;
		for (int i = 0; i < chars.length; i++) {
			z = new BinaryTree();
			z.makeTree(chars[i], null, null);
			z.getRoot().weight = weight[i];
			list.add(z);
		}

		minHeap = new MinHeap<BinaryTree>();
		minHeap.init(list);
		deletedTree1 = null;
		deletedTree2 = null;
	}