m0_56728976的博客

代码：#include <iostream>using namespace std;template<class T>struct Node{ T data; Node<T>* next; // 后继结点 Node<T>* prior; // 前驱结点 Node() { next = nullptr; prior = nullptr; } explic

代码：#include<iostream>using namespace std;template<class T>class Stack{ T* s; int topnum; int capacity;public: Stack(int stackCapacity = 100); void push(const T& item); void pop(); bool empty()const;

@C++数据结构——单链表C++数据结构——单链表代码版本一：#include <iostream>using namespace std;template<class T>struct Node{ T data; Node<T>* next; Node() { next = nullptr; } explicit Node(T item, Node<T>* ptr = nu

代码：#include<iostream>using namespace std;template <class T>struct Node{ T data; //数据域 Node<T>* next; //指针域 Node() { next = nullptr; } explicit Node(T item, Node<T>* ptr = nullptr) { data = item; next = ptr;

代码：#include <iostream>using namespace std;template<class Q>class Queue{ Q* queue; int front; int rear; int count; int capacity;public: Queue(int queueCapacity = 100); ~Queue(); void push(const Q& ite

主页有其他数据结构内容（持续更新中）代码：#include<iostream>using namespace std;template <class T>struct Node{ T data; //数据域 Node<T>* next; //指针域 Node() { next = nullptr; } Node(T item, Node<T>* ptr