1. (15分) Run the Breadth-First Search (BFS) algorithm to generate a BFS searching tree which has the nodes as its root. Run the algorithm step by step.

6. (10 分) 使用 linked list 實作 stack，運用以下 C 語言程式：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));// 實作以下敘述// add new_node to stack by top}int pop (node **top) { // assume top is not nullint value;node deleting_node = top;// 實作以下敘述// remove the deleting node from stack, get the value of deleting nodefree(deleting_node);return value;}

1. (15分) Run the Breadth-First Search (BFS) algorithm to generate a BFS searching tree which has the nodes as its root. Run the algorithm step by step.

相關申論題

相關試卷