const level_found = findNode(remove_key, &preds, &succs);

                const level_found = findNode(remove_key, &preds, &succs) orelse return false;

                if (is_marked or
                    (level_found != null and okDelete(succs[level_found.?].?, level_found.?)))
                {

                if (is_marked or okDelete(succs[level_found].?, level_found)) {

                        node_delete = succs[level_found.?].?;

                        node_delete = succs[level_found].?;

                    // TODO: if it never fails we can change node_delete type to *Node
                    std.debug.assert(node_delete != null);

                        // Make sure that the newly set next node does not equal to the one marked for removal
                        std.debug.assert(node_delete.?.nexts[level - 1] != node_delete);

                    // Already marked for deletion or (not found or !okDelete)

                    // Already marked for deletion or !okDelete