This is referred to as LIFO (last in, first out).

• 栈中的元素被删除的顺序和进入的顺序相反，常被称作后进先出。