Multiple choice:Let `h` be the head of a singly linked list without a dummy head
Let `h` be the head of a singly linked list without a dummy head node. To insert a new node `t` as the first node, we must do: @[D](2)
A. `h=t; t->next=h->next;`
B. `t->next=h->next; h=t;`
C. `h=t; t->next=h;`
D. `t->next=h; h=t;`
A.`h=t; t->next=h->next;`
B.`t->next=h->next; h=t;`
C.`h=t; t->next=h;`
D.`t->next=h; h=t;`
answer:D
A. `h=t; t->next=h->next;`
B. `t->next=h->next; h=t;`
C. `h=t; t->next=h;`
D. `t->next=h; h=t;`
A.`h=t; t->next=h->next;`
B.`t->next=h->next; h=t;`
C.`h=t; t->next=h;`
D.`t->next=h; h=t;`
answer:D