algo_003.md (357B)
1 # algo_003 2 3 ### Problem Statement 4 5 > Write an algorithm to traverse a singly linked list. 6 7 ## Algorithm 8 ``` 9 procedure traverce(head) 10 begin 11 if(head = NULL) 12 write("List is empty"); 13 else 14 ptr ← head; 15 while(ptr ≠ NULL) 16 write(info(ptr)); 17 ptr ← next(ptr); 18 end while 19 end if 20 end procedure 21 ```