1. ## Flow chart for linked list

I'm sorry if this is a stupid question but can't create linked list on paper with pencil

I have decided to make flow chart first for linked list . I know pointer, structure and dynamic memory allocation are the three basic features of linked list. I understand all those three but I can't figure out on paper for linked list

I do not have any idea to create flow chart for linked list.

2. Originally Posted by Salem
I can get a lot of source codes but I am asking suggestion for flow chart.

Take a look this example

How to make flow chart for this operation

3. I found this link by searching on "linked list pseudocode"; Likes like good pseudocode to me.

NOTE: This is not a website that does your homework!

Tim S.

4. > How to make flow chart for this operation
What operation?

How to create it?
How to traverse it?
How to delete it?

Make a flow chart of this
while ( node != NULL ) node = node->next;

This is at the heart of every linked list operation, because it is how you traverse the list.

Adding, deleting, searching are just decorations of that.

5. Originally Posted by Salem
How to create it?
How to traverse it?
How to delete it?

Make a flow chart of this
while ( node != NULL ) node = node->next;
I know it's not complete flow chart and I need to improve it but It's my best attempt to make flow chart

How to improve above flow chart any suggestion would appreciate on flow chart

6. You have a backward pointing arrow to make a loop.
You have a "False" coming out of your <> diamond to get out of that loop.

7. Originally Posted by Salem
You have a backward pointing arrow to make a loop.
You have a "False" coming out of your <> diamond to get out of that loop.
okay I have corrected points

How to make it batter

8. No it's not right at all.

False EXITS the loop.
True does some work, does node = node->next and jumps back to the test.

9. Originally Posted by Salem
No it's not right at all.

False EXITS the loop.
True does some work, does node = node->next and jumps back to the test.
okay modified version

10. Your true loop needs to end up pointing back at the <>

You've got it pointing back at "set pointer to the head of the list".

11. It's a linked list; i.e. essentially the most elementary data structure/abstract data type known to the human species. Perhaps you should buy a book. I shudder in horror trying to imagine what will happen when you get to doubly-linked lists or, god forbid, trees.

12. Originally Posted by Salem
Your true loop needs to end up pointing back at the <>

You've got it pointing back at "set pointer to the head of the list".
okay Now I need to draw flow chart to print node. How to go for next steps

once flow chart will complete I will try to write code

13. Between the <> and [next] activity, you put a [work] activity box.

Work being whatever it is you want to do with a node in your list.