// singly linked list
//
#ifndef LL_H_
#define LL_H_

#include "Node.h"

class LL
{
 private: Node *head, *tail;

 public: LL() { head = tail = nullptr; }

  bool empty() const; // true if list is empty, otherwise false

  void push_front( long d); // insert in front of head
  void push_back( long d);  // insert after tail

  long pop_front();         // remove from head
  long pop_back();          // remove from tail

  void reverse(); // put list in reverse order

  void print() const; // print the list
};

#endif // LL_H_