You could create additional pointers to the linked list that you assign during the search functions (Pass the pointers as parameters).

Then, once you've searched, you can continue to bring up...

... right. Well, if you were only TESTED on powers of two, I'm right, but my code isn't gonna cut it past 4.

the answer to number 3 (assuming the number is an integer) is to use the modulous operator, %.

if(!(numbername%2))
cout<<numbername<<" is a power of 2."<<endl;

More precisely, look for spaces ONLY after characters.
That will help you a great deal with tabs and incorrect spacing.

Whoops. Test is supposed to be 'trans'. I wrote this all without a compiler, so I didn't catch the typo.

Fixed it.

And I also started to smile at 'OMGEUREKAPWNZD!'. I think I'll start using...

S'okay. Let's expand the node I wrote.


struct node
{
int blar[3];
node *next;
}

1. Think of it like this: The pointer to the beginning is the anchor, and what you use it for is to point to the first entry in your singly-linked list (SLL). Until you use it, however, it's a good...