Documentation
¶
Overview ¶
***************************************
* File Name : stkarray.go
* Creation Date : 03-09-2020
* Last Modified : Thursday 03 September 2020 10:21:12 AM
* Created By : Bhaskar Tallamraju
* Description: stack implementation using arrays * * Stack: its a data structure which works based on principle of last in first out (LIFO). * In computing world, stack data structure can be applied in many applications such as * parsing syntax of expressions and solving search problem. Push and pop are the operations * that are provided for insertion of an element into the stack and the removal of an element * from the stack. ****************************************
***************************************
* File Name : stkllist.go
* Creation Date : 02-09-2020
* Last Modified : Thursday 03 September 2020 10:19:46 AM
* Created By : Bhaskar Tallamraju
* Description: stack implementation using linkedlist * * Stack: its a data structure which works based on principle of last in first out (LIFO). * In computing world, stack data structure can be applied in many applications such as * parsing syntax of expressions and solving search problem. Push and pop are the operations * that are provided for insertion of an element into the stack and the removal of an element * from the stack. * Example : * topstack -> |newElement|next| -> |5|next| -> |7|next| -> |firstelement|next|->NULL * * topstack ptr points to the new element pushed and gets popped from there too. ****************************************
Source Files