My understand of stack and queue-优快云博客

本文链接：https://blog.youkuaiyun.com/warrior_zhang/article/details/50503344

本文详细解释了栈和队列的基本概念、特点、实现方式，并通过实例展示了如何利用它们解决实际问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

First:Abstract
stack and queue have the same logical structure like linear list. But the stack only can write and read at one side of the list; the queue only can write at one side of the list and read at the other side of the list.
Second:
1,stack:
      (1)
      include "top pointer" "bottom pointer" "stack size"
      feature:FILO:first in last out
         (2)create way
      down:
          top point to the high address while bottom point to the low address
          when "pop" top-- "push" top++
      up:
          opposite compare above
      (3)abstract data type
          common stack
          typedef struct
          {
              int *base;
              int *top;
              int stacksize;
            } Stack;
          link stack
          typedef struct SNode
          {
              int data;
              struct SNode *next;
          } SNode, *LinkStack;
   2,queue

阅读(8) | 评论(0) | 转发(0) |

上一篇：shell 编程语法总结（I/O 逻辑控制结构）

下一篇：My understand of KMP describe in C