Shulou(Shulou.com)06/02 Report--

This article mainly introduces whether the stack and queue belong to nonlinear data structure, the article is very detailed, has a certain reference value, interested friends must read it!

Stack and queue are not nonlinear data structure, stack and queue are linear logical structure, stack is a kind of linear table with limited operation, which is limited to insert and delete operation at the end of the table; queue is a special linear table, it only allows delete operation at the front end of the table and insert operation at the back end of the table.

Stack, also known as stack, is a linear table with limited operations. Qualifies linear tables that insert and delete only at the end of the table. This end is called the top of the stack, on the contrary, the other end is called the bottom of the stack. Inserting a new element into a stack is also called entering, entering, or pressing the stack. It puts the new element on top of the stack and makes it a new top element. Removing an element from a stack is also called making a stack or unstack. It removes the top element of the stack and makes its adjacent elements a new top element of the stack.

As a data structure, stack is a special linear table that can only insert and delete at one end. It stores data according to the first-in-first-out principle, the first-in data is pressed into the bottom of the stack, the last data is at the top of the stack, and the data pops up from the top of the stack when it needs to be read (the last data is read out first). The stack has the function of memory, and there is no need to change the pointer at the bottom of the stack in the insertion and deletion of the stack.

A stack is a special linear table that allows inserts and deletions on the same side. One end that allows insert and delete operations is called the top of the stack (top), and the other end is the bottom of the stack (bottom); the bottom of the stack is fixed, and the top of the stack is floating; 00:00 in the number of elements in the stack is called empty stack. Insertion is generally called PUSH, while deletion is called POP. The stack is also known as a first-in-first-out table.

Queue is a special linear table, which is special in that it only allows deletion at the front end of the table (front) and insert operation at the back end of the table (rear). Like the stack, queue is a linear table with limited operations. The end of the insert operation is called the end of the queue, and the end of the delete operation is called the head of the line. When there are no elements in the queue, it is called an empty queue.

The data element of a queue is also called a queue element. Inserting a queue element into the queue is called queuing, and removing a queue element from the queue is called dequeuing. Because queues are only allowed to be inserted at one end and deleted at the other end, only the earliest elements that enter the queue can be deleted from the queue first, so the queue is also known as the first-in-first-out (FIFO-first in first out) linear table.

These are all the contents of the article "whether stacks and queues belong to nonlinear data structures". Thank you for reading! Hope to share the content to help you, more related knowledge, welcome to follow the industry information channel!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.