(a).移動到終點

6. (20%)使用 linked list 完成以下 stack 程式typedef struct node { int value; node *next;}void push (node **top, int new_value) { // assume top is not nullnode *new_node = (node *) malloc (sizeof (node));// Your answer starts here// add new_node to stack by top}int pop (node **top) { // assume top is not nullint value;node *deleting_node = *top;// Your answer starts here// remove the deleting node from stack, get the value of deleting nodefree(deleting_node);return value;}

題組內容

(a).移動到終點

相關申論題

相關試卷