notes printf "\ /traverse the entire linked list *while !null printf "% " -data -link printf "\ /counts the number of nodes present in the linked list representing stack *count struct node int /traverse the entire linked list *while !null -link +return summary stack is linear data structure having very interesting property that an element can be inserted and deleted not at any arbitrary position but only at one end one en of stack remains sealed for insertion and deletion while the other end allows both the operations stack possesses lifo (last in first outproperty there are two basic methods for the implementation of stacks one where the memory is used statically and the other where the memory is used dynamically push is stack operation in which an element is added to stack pop is stack operation that removes an element from the stack stack is used to store return information in the case of function/procedure/subroutine calls henceone would find stack in architecture of any central processing unit (cpuin infix notation operators come in between the operands an expression can be evaluated using stack data structure keywords infixnotation of an arithmetic expression in which operators come in between their operands lifo(last in first outthe property of list such as stack in which the element which can be retrieved is the last element to enter it popstack operation retrieves value form the stack lovely professional university