//**************************************************************
//
//  CS 240B   : Winter 2003 Ohio University Travis Dillon
//  Project 5 : linked list
//  file      : node.h
//  started   : 02-27-03
//
//**************************************************************

#ifndef NODE_H
#define NODE_H

#include "prog5b.h"

class List;

class Node
{ 
   friend class List;
   friend ostream& operator <<(ostream& os,const Node& rop);
   friend ostream& operator <<(ostream& os,const List& rop);
   friend void sorted_merge(List& out, List& in1, List& in2);
 public:  
   Node(T dat = 0) {data = dat; fore = NULL;};
   T get_data() {return data;};
 private:
   T data;
   Node* fore;
};

#endif  //NODE_H