Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //main
- #include <iostream>
- #include "Node.h"
- #include "Kolejka.h"
- using namespace std;
- int main()
- {
- Kolejka k;
- k.push(1);
- k.push(25);
- k.push(77);
- k.printKol();
- k.pop();
- k.printKol();
- return 0;
- }
- //kolejka.h
- #ifndef KOLEJKA_H
- #define KOLEJKA_H
- #include "Node.h"
- class Kolejka
- {
- private:
- Node *head, *tail;
- public:
- Kolejka();
- ~Kolejka();
- void push(int info);
- Node* pop();
- void printKol();
- bool isEmpty();
- };
- #endif // KOLEJKA_H
- //kolejka.cpp
- #include "Kolejka.h"
- #include "Node.h"
- #include <iostream>
- Kolejka::Kolejka()
- {
- head = tail = 0;
- }
- Kolejka::~Kolejka()
- {
- //dtor
- }
- bool Kolejka::isEmpty(){
- if (head == 0)
- return 1;
- else
- return 0;
- }
- void Kolejka::push(int el){
- if (isEmpty()){
- Node* tmp = new Node(el);
- head = tmp;
- tail = tmp;
- }
- else{
- Node* tmp = new Node(el);
- tail->setNext(tmp);
- tail=tmp;
- }
- }
- Node* Kolejka::pop(){
- if (isEmpty()){
- std::cout << "error";
- return 0;
- }
- else{
- Node* tmp = head;
- head = head->getNext();
- return tmp;
- }
- }
- void Kolejka::printKol(){
- Node* tmp = head;
- while (tmp != 0){
- std::cout << tmp->getInfo() << " ";
- tmp = tmp->getNext();
- }
- std::cout << std::endl;
- }
- //node.h
- #ifndef NODE_H
- #define NODE_H
- class Node
- {
- private:
- int info;
- Node* next;
- public:
- Node();
- ~Node();
- Node(int inf);
- Node* getNext();
- void setNext(Node* nex);
- int getInfo();
- void setInfo(int inf);
- };
- #endif // NODE_H
- //node.cpp
- #include "Node.h"
- Node::Node()
- {
- info = 0;
- next = 0;
- }
- Node::~Node()
- {
- //dtor
- }
- Node::Node(int inf){
- info = inf;
- next = 0;
- }
- Node* Node::getNext(){
- return next;
- }
- void Node::setNext(Node* nex){
- next = nex;
- }
- int Node::getInfo(){
- return info;
- }
- void Node::setInfo(int inf){
- info = inf;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement