堆栈和队列之间的区别

In this article you will learn about difference between stack and queue.

在本文中，您将了解堆栈和队列之间的区别。

Stack

叠放

A Stack data structure works on Last In First Out principle, also abbreviated as LIFO. A Stack requires only one reference variable, known as a top pointer. Stack data structures are normally represented as a vertical representation of data items.

堆栈数据结构基于后进先出原理(也称为LIFO)工作。 堆栈仅需要一个参考变量，即顶部指针。 堆栈数据结构通常表示为数据项的垂直表示。

A Stack Data Structure can be represented in static arrays as well as linked lists. In a stack, the data items can be inserted and deleted from the same end. The element to be inserted first is the last element to get deleted. Both the operations, insertion and deletion occur at the TOP reference pointer. A Stack doesn’t necessarily contain ordered collection of data items.

堆栈数据结构可以用静态数组和链表表示。 在堆栈中，可以从同一端插入和删除数据项。 首先插入的元素是要删除的最后一个元素。 插入和删除操作都发生在TOP参考指针处。 堆栈不一定包含数据项的有序集合。

Stack Implementations:

堆栈实现：

Stack data structure is used in infix to postfix conversion, scheduling algorithms, evaluation of an expression and depth first search.

堆栈数据结构用于中缀到后缀的转换， 调度算法，表达式的评估和 深度优先搜索。

The condition to check if a stack is empty:

检查堆栈是否为空的条件：

int isEmpty()
{
	if(top==-1)
		return 1;
	else
		return 0;
}

The condition to check if a stack is full:

检查堆栈是否已满的条件：

int isFull()
{
	if(top==MAX-1)
		return 1;
	else
		return 0;
}

Queue

队列

A Queue data structure works on First In First Out principle, also abb