假设一个存储结构实现双向堆栈顺序,也就是说,一维数组的储存空间,有两个堆栈,他们位于底部的堆阵列的两个端点。尝试着去写实现双向堆Tws三种操作:最初的inistack(Tws),到堆栈推(Tws,我、x)和堆栈流行(Tws,我)算法,该算法可以我0或1,所以分别在一个数组或指示两端的两个堆栈。-Suppose a storage structure order implement a two-way stack, that is, the one dimensional array of storage space has two stack, they are located in the bottom of the stack of the array of two endpoints. Try to write to realize the two-way stack of Tws three operation: the initial inistack (Tws), into the stack push (Tws, I, x) and the stack pop (Tws, I) algorithm, which I 0 or 1, respectively in an array or so for instructions on both ends of the two stack.