algo_031.md (310B)
1 # algo_031 2 3 ### Problem Statement 4 5 > Write an algorithm to pop to stack (Linked representation of stack) 6 7 ## Algorithm 8 ``` 9 procedure pop(stack, val) 10 begin 11 if(stack = NULL) 12 write("Empty"); 13 else 14 ptr ← stack; 15 stack ← next(ptr); 16 delete(ptr); 17 return(stack); 18 endif 19 end procedure 20 ```