JavaScript data structures and algorithms--stacks

Objective:

Stacks are similar to a list of data structures, but the stack is characterized by ' descendants first out '. Stacks are an efficient data structure, because data can only be added or deleted at the top of the stack, so this is fast and easy to implement.

1. Introduction of the Stack:

A stack is a special list of elements that can only be accessed by one end of the list, called the top of the stack, and the other end as the bottom of the stack. For example, the restaurant Luo Plate, only from the top of the plate, the plate washed clean, but also only Luo in the top. Stacks are called first-in -A-out (LIFO) data structures.

:

JavaScript data structures and algorithms--stacks