Question

Write a program in three parts. The first part should create a linked list of 26 nodes. The second part should fill the list with the letters of the alphabet. The third part should print the contents of the linked list.

Answer 1

How far have you gotten what do you have down with regards to linked list? I can give you the pseudocode break down but it won't do good if I'm telling you something you should pretty be familiar with.

Answer 2

#include <iostream>
using namespace std;
int main()

struct node
{
int value;
node*next;
}

{
node*top;
top=new node;
(*top).value=1
(*top).next=new node;

Answer 3

any help will be greatly appreciated

Answer 4

Looks like you got most of it down what do you feel you're confused about?
All that's really next is to create a node linked list of the alphabet by creating a node called alphabet where the first node in the list is A then that points to the next.node B which points to C...

You get the point.

Answer 5

so that was the second part?

Answer 6

Yep you already have your node struct to that allows you create other nodes which then form a connection to eachother which as a result forms linked list of nodes.

Now within your node struct you have 2 objects.
an int called value and another pointer to a node called next.
All you have to do now is fill each one individually and link them.

Answer 7

struct item
{
int data;
item *next;
};
int main()
{
item*first,*current
first=new item;
(*first).data=1;
current=first;
for (i=2; i<=100; i++)
{
(*current).next=new item;
current=(*current).next;
(*current).next=NULL;
}

what does this code mean?

Answer 8

Did you write it or did you copy it? If so what does the book say? Let's work from there, give me your rough understanding. Anything would help.

Answer 9

I copied it from the board

Answer 10

those were the notes for that assignment

Answer 11

#include <iostream>
using namespace std;

struct item
{
int data;
item *next;
};

int main()
{
item*first*current; //Creating a item called first and current
first = new item; //set some memory on the stack for first
(*first).data = 1; //set our first data field to 1
current = first; //as of right now current is first
for(i=2;i<100;i++)//creating a linked list of numbers 1 -100
{//BEGIN THE LIST
(*current).next = new item;//have current point to our new item (****Wait huh? why we still haven't put anything in current...<-hint
current=(*current).next;//Okay lets move to the next node in the list
(*current).next = NULL; //END THE LIST
}


}

Answer 12

let me know what confuses you logically.

Answer 13

for(i=2;i<100;i++)

so should I change this to for(i=2;i<26;i++)

Answer 14

Why not go ahead and let i be a char which holds the values from 'A' - 'Z' because if we look at the ascii table A-Z is 26 letters total, so that should take care of the size.
And snce our counter i is now a char we can go ahead set our data to i within the forloop.

Answer 15

oh ok, thanks for the help

Answer 16

Anytime let me know if you have any confused I enjoy the functionality of nodes. They're awesome.

Answer 17

ok, thanks. I appreciate it.