Remove comments from
C code.

/* Linked list implementation. */
#include <stdio.h>
#include <stdlib.h>

// Forward declaration
struct Node;

/**
 * A doubly-linked node.
 */
typedef struct Node {
    int value;       // payload
    struct Node *next;  // next pointer
    struct Node *prev;  // prev pointer
} Node;

// Allocate a new node
Node *node_new(int value) {
    Node *n = malloc(sizeof(Node)); /* allocate */
    if (!n) return NULL;
    n->value = value;
    n->next = NULL;
    n->prev = NULL;
    return n; // ownership transferred
}

#include <stdio.h>
#include <stdlib.h>

struct Node;

typedef struct Node {
    int value;
    struct Node *next;
    struct Node *prev;
} Node;

Node *node_new(int value) {
    Node *n = malloc(sizeof(Node));
    if (!n) return NULL;
    n->value = value;
    n->next = NULL;
    n->prev = NULL;
    return n;
}