private void heap_down() {
        Binarynode node = root;
        Binarynode help;
        int valuehelper;
        while (true) {
            if (node.right == null || node.left.value > node.right.value) {
                help = node.right;
            } else {
                help = node.left;
            }

            if (help != null && help.value < node.value) {
                valuehelper = node.value;
                node.value = help.value;
                help.value = valuehelper;
            } else {
                return;
            }
            node = help;
        }
    }