Chapter 4 Data Structure 4.2 Stacks The end of a stack at which entries are inserted and deleted is called the top of the stack. The other end is sometimes called the stack's base. To reflect the fact that access to a stack is restricted to the topmost entry, we use special terminology when referring to the insertion and deletion operations. The process of inserting an object on the stack is called a push operation, and the process of deleting an object is called a pop operation. Thus we speak of pushing an entry onto a stack and popping an entry off a stack 堆栈尾部可以进行插入和删除操作的记录称为堆栈的栈顶, 另一端叫做栈底。为了表示如何限制堆栈只能从栈顶访问, 我们用一种特殊的术语来表示插入和删除操作。把,个对象 插入堆栈的操作称为进栈操作,而从堆栈中删除,个对象的 操作称为出栈操作,所以我们常说将一个条目进栈或者将其 出栈。 《什第机美语 4-11Chapter 4 Data Structure 计算机专业英语 4-11 The end of a stack at which entries are inserted and deleted is called the top of the stack. The other end is sometimes called the stack's base. To reflect the fact that access to a stack is restricted to the topmost entry, we use special terminology when referring to the insertion and deletion operations. The process of inserting an object on the stack is called a push operation, and the process of deleting an object is called a pop operation. Thus we speak of pushing an entry onto a stack and popping an entry off a stack. 堆栈尾部可以进行插入和删除操作的记录称为堆栈的栈顶， 另一端叫做栈底。为了表示如何限制堆栈只能从栈顶访问， 我们用一种特殊的术语来表示插入和删除操作。把一个对象 插入堆栈的操作称为进栈操作，而从堆栈中删除一个对象的 操作称为出栈操作，所以我们常说将一个条目进栈或者将其 出栈。 4.2 Stacks