private void prepareTreeToWrite(Node node, final int infoPos, int deep) {
        char[] log = null;
        log = list.get(deep);

        log[0] = String.valueOf(deep).charAt(0);
        if (deep > 9) log[1] = String.valueOf(deep).charAt(1);

        int newPosLeft = (int) (infoPos - infoPos/12);
        int newPosRight = (int) (infoPos + infoPos/12);

        if (node.left != null) {
            log[newPosLeft] = node.left.info.charAt(0);
            log[newPosLeft - 1] = '[';
        }
        if (node.right != null) {
            log[newPosRight] = node.right.info.charAt(0);
            log[newPosRight + 1] = ']';
        }
        //System.out.println(log);

        if (node.left != null) {
            prepareTreeToWrite(node.left, newPosLeft - 2, deep + 1);
        }
        if (node.right != null) {
            prepareTreeToWrite(node.right, newPosRight + 2, deep + 1);
        }
    }