1. Set NUM : = 0 . [Initializes Counter]
2. Set PTR : = START. [Initializes Pointer]
3. Repeat Steps 4 and 5 while PTR != NULL.
5. Set PTR : = LINK[PTR]. [Update pointer..]
[End of Step 3 Loop]
6. 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