1. Set PTR : = START .
2. Repeat Steps 3 and 4 while PTR != NULL.
3. Write: INFO[PTR]
4. Set PTR : = LINK[PTR]. [Update pointer..]
[End of Step 2 Loop]
5. Return.
Data Structure, Data, Data Information, Programming, Coading, Algorithm,Linked,List,Tree,Sorting,Searching,Complexity,String, Stack,Queues,Recursion, Polish Notation,Ackermann Function, Tower of Hanoi,Graph, Shortest Path Algorithm, Warshall's.
0 comments:
Post a Comment