数据库考题及答案.pdfVIP

Data Structures and Algorithms – MidTerm Exam 1. Let ‘I’ be “push”, ‘O’ be “pop” and ‘P’ be “print” directly. To convert the infix expression a+(b*c–d)/e to its postfix through a stack, the sequence of operations are PIIPIPOIPOOIPOO (For example: (a+b) is converted to ab+ by IPIPOO.) (5 points) 2. In a binary tree of N nodes, there are N+1 NULL pointers representing children. (2 points) 3. A sorting algorithm is stable if elements with equal keys are left in the same order as they occur in the input. Which