private void byWidth(BinaryTree[] mas, int counter, int counterMas) {
		System.out.print(mas[counter].getValue() + " ");
		if (mas[counter].left != null) {
			counterMas++;
			mas[counterMas] = mas[counter].left;
		}
		if (mas[counter].right != null) {
			counterMas++;
			mas[counterMas] = mas[counter].right;
		}
		counter++;
		if (counter < amount)
			byWidth(mas, counter, counterMas);
	}