Reverse_linked_list_iterative_template.cpp

// Copyright (c) 2013 Elements of Programming Interviews. All rights reserved.

#include <iostream>
#include <memory>

#include "./Linked_list_prototype_template.h"
#include "./Reverse_linked_list_iterative_template.h"

using std::cout;
using std::endl;
using std::make_shared;
using std::shared_ptr;

template <typename T>
void print(shared_ptr<node_t<T>> head) {
  if (head) {
    cout << "(" << head->data << ")" << endl;
    print(head->next);
  }
}

int main(int argc, char* argv[]) {
  shared_ptr<node_t<int>> L1 = make_shared<node_t<int>>(node_t<int>{1, nullptr});
  shared_ptr<node_t<int>> L2 = make_shared<node_t<int>>(node_t<int>{2, nullptr});
  L1->next = L2;
  shared_ptr<node_t<int>> L3 = make_shared<node_t<int>>(node_t<int>{3, nullptr});
  L2->next = L3;

  cout << "before reverse" << endl;
  print(L1);
  shared_ptr<node_t<int>> newhead = reverse_linked_list<int>(L1);
  cout << endl << "after reverse" << endl;
  print(newhead);
  newhead = reverse_linked_list<int>(newhead);
  cout << endl << "after another reverse" << endl;
  print(newhead);
  return 0;
}