A linear stacks and queues are two special table data structures, among them is a linear relationship is the predecessor successor relationship.

A stack

1 Overview

Stack only allow linear table insertion and deletion operations in the end of the table, the call stack of inserts and deletes a paragraph, and the other end is the bottom of the stack, it is a last-out, as shown below is a typical structure of his :

Stack with linear tables, generally including insert, delete, and other basic operations. He is usually achieved in two ways: to achieve the array (that is sequential memory) based linked list implementation (ie, chain store) based on

Sequential storage structure (1) of the stack

Sequential storage stack structure is actually a simplified structure linear sequence storage table, it can be referred to as a sequence of stack, which stores the following structure:

(2) Storage Structure stack

Storage Structure of the stack, referred to as link stack. Generally the top of the stack at the head of a single list. Generally for link stack is unnecessary, the head node. Storing structure as shown below:

 Second, the queue

Data queue is only inserted at one end, the other end of the linear deletion operation table, it is a set of FIFO type of strategy allows the insertion of the end of the tail is referred to, is allowed to delete the queue head end. Similarly, the queue having two storage methods: sequential storage and chain stores.

(1) stored in the order queue structure

He and the stack is different, the stack is equivalent to a bucket continue to hold things, and imagine the queue to 10 arranged in a queue in the order through an underground channel model, this is the underground passage to the class of memory, this is a personal which is data; dequeue the queue element is in the first team, i.e. position 0 of the table. To ensure that the first team is not empty, all of the elements after each dequeue the queue had moved forward in this time complexity is O (n). At this time, the order of implementation of a queue memory structure and identical to the linear form. The following structure:

(2) Storage Structure queue

Storage Structure queue, in fact, single-chain linear form, but it can only head out into the end of it, we referred to as' queue chain. " Storage structure shown below:

The above is a basic understanding of stack and queue;

Third, the summary

Stacks and queues, which are special linear table, just insert and delete operations have been restricted. The stack can only be defined in the top of the stack insertions and deletions, and the queue is defined only in the tail is inserted, deleted HOL. They can be implemented using sequential storage structure and the storage structure of the chain in two ways.