112年 - 112 國立臺北大學_日間學士班轉學生招生考試試題_資訊工程學系日間學士班3年級：資料結構#147429

1. (1) Use Heap Sort to sort: 60 80 45 2 36 98 11 47 52 89 75 63 7. Show the sorting process. (5%)

(2) How does system stack work? (5%)

2. Convert inorder statement: A*B+C*(D-E)/(F+H) to postorder, and print the binary tree. Please convert by the statement order from left to right to generate the unique answer. Also, design an algorithm based on stack to implement the inorder-to-postorder conversion. (15%)

(1) add each polynomial by exponential order

(2) the control of processing values in the linked lists

(3) The ending condition of completing the adding process

4. Use linked list to implement a stack in C: (10%)

5. Use queue to implement level order traversal conversion in C: (15%)

6. Implement Sparse Matrix Transpose function without nested for loop.(15%)

7. Maze path search function by stack. (25%)