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%)

7. Maze path search function by stack. (25%) void path() { // assume int maze[30][30] and offsets move[8] has been set in main function // typedef struct {int v; int h;} offsets; int i, row, col, next_row, next_col, dir, found = 0, top =0, mark[30][30]; typedef struct { int row; int col; int dir;} element element position, stack[100]; mark[1][1] = 1; stack[0].row = 1; stack[0].col = 1; stack[0].dir = 0; // Use stack to get current row, col, dir // Use dir to calculate next_row, next_col // Use next_row, next_col to check this move (1) arrive exit, or // (2) become a legal move; add this move into the stack or // (3) check other dir }

2. Convert inorder statement: AB+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%)

相關申論題

相關試卷