Advertisement
Guest User

Untitled

a guest
Apr 5th, 2021
26
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.91 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. struct Node
  4. {
  5. int value;
  6. Node *next;
  7. };
  8.  
  9. class LinkedList
  10. {
  11. private:
  12. int itemsNumber;
  13. Node *root;
  14. Node *head;
  15.  
  16. public:
  17. LinkedList() : head(nullptr), root(nullptr), itemsNumber(0) {}
  18. void clear() {}
  19. void add(int value)
  20. {
  21.  
  22. Node *node = new Node;
  23. node->value = value;
  24. node->next = nullptr;
  25. if (root == nullptr)
  26. root = node;
  27. else
  28. head->next = node;
  29. head = node;
  30. itemsNumber++;
  31. }
  32. void remove() {}
  33. void print()
  34. {
  35. Node *temp = root;
  36. for (size_t i = 0; i < itemsNumber; i++)
  37. {
  38. std::cout << temp->value << " ";
  39. temp = temp->next;
  40. }
  41. }
  42. };
  43.  
  44. int main()
  45. {
  46. LinkedList list;
  47. list.add(3);
  48. list.add(3);
  49. list.add(3);
  50. list.add(33);
  51. list.print();
  52. return 0;
  53. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement