Linked lists

No, just in a very basic sense... we're not supposed to be using containers, templates, etc., just the basic pointer operations to create a node, add a node to the list, delete a node, count the number of nodes, etc.

For explanation of what the data structures are all about, try this link:

http://hissa.nist.gov/dads/terms.html

you should find some help there.


For general C++ help, tutorials, etc. (e.g. about pointers), try this:

http://www.cetus-links.org/oo_c_plus_plus.html

> Hope this is not an academic assignment

You are allowed to provide some assistance with academic assignments.  Pointing to information sources, is allowed, I think.

try:
http://www.epaperpress.com/s_man.html; http://wannabe.guru.org/alg/; http://www.snippets.org/

#include <iostream.h>

struct aNode
{
        int value;
        aNode *next;
};

typedef aNode Node;


class List
{
      protected:
                Node *head;
      public:
             // Constructors
             List(): head(0) {}

             // Destructor
             ~List();

             // Methods
             bool insert(int arg);
             unsigned long length() const;
             bool pop();

             // Friend functions
             friend ostream& operator <<(ostream &ostr,const List &lst);
};

List::~List()
{
 Node *temp=0;

 while ( head ) {
       temp=head->next;
       delete head;
       head=temp;
 }
}

bool List::insert(int arg)
{
 Node *temp=0;
 temp=new Node;
 if ( !temp ) return false;
 temp->value=arg;
 temp->next=head; head=temp;
 return true;
}


unsigned long List::length() const
{
 unsigned long nNodes=0UL;
 for ( Node *temp=head ; temp ; temp=temp->next ) ++nNodes;
 return nNodes;
}


bool List::pop()
{
 if ( !head ) return false;
 Node *temp=head->next;
 delete head;
 head=temp;
 return true;
}


ostream& operator <<(ostream &ostr,const List &lst)
{
 if ( !lst.head ) return ostr;
 ostr<<lst.head->value;
 for ( Node *temp=lst.head->next ; temp ; temp=temp->next )
     ostr<<' '<<temp->value;
 return ostr;
}


int main()
{
 List z;

 if ( !z.insert(89) ) return 0;
 if ( !z.insert(900) ) return 0;
 if ( !z.insert(-8765) ) return 0;
 cout<<z<<endl;
 z.pop();
 cout<<z<<endl;
 cout<<"Actual length is";                cout<<z.length()<<endl;
 return 0;
}

MFC has some built-in class for link-list such as CArray, CStringArray,
etc...

Your question is still open today.  Have you been helped so that you may close this question or is more needed?  Due to the age of this question, and some of the conversions we've undergone since that time, you'll notice that the comments are not in date order, so if you plan to choose a comment as the answer to grade and close, you may wish to note that.  If you require special handling of this question, a zero point question in the Community Support topic area with a link to this question and your desires (delete/refund) will accomplish that.

With the volumes of new activity, it is unlikely that people will find this question at this point, due to its ageif you were waiting to get new information or current attention.  If more is needed, your comment will generate a message to the experts who participated previously here with you, and hopefully then resume the process.

Thank you, your responsinveness is definitely appreciated.
Asta

I think you forgot this question. Please grade the answer(s) given or ask back if there is more information needed. Please feel free to delete the question if there wasn't any help given. You will get your points back and if still interested could repost your question. I will ask CS to close this question if there is no more feedback.

Please do not accept this comment as an answer!
======
Werner