Follow

Translate

Monday, March 14, 2016

Home » » Two basic Operation Of Stack

Two basic Operation Of Stack

Unknown  1:35:00 PM    No comments

(a) "PUSH" is the term used to insert an element into a stack.
(b) "POP"   is the term used to remove an element into a stack.
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE

Related Posts:

  • Inserting at the Beginning of a List Algorithm:   INSFIRST(INFO,  LINK,  START, AVAIL, ITEM) This algorithm inserts ITEM as the first node in the list. 1.     [OVERFLOW?]  If AVAIL = NULL , then : Write: OVERFLOW… Read More
  • Inserting after a Given Node Algorithm:  INSLOC(INFO, LINK, START, AVAIL, LOC, ITEM) This algorithm inserts ITEM so that ITEM follows the node with location LOC or inserts ITEM as the first node when LOC = NULL. 1.        … Read More
  • Inserting after a Given Node Algorithm:  INSLOC(INFO, LINK, START, AVAIL, LOC, ITEM) This algorithm inserts ITEM so that ITEM follows the node with location LOC or inserts ITEM as the first node when LOC = NULL. 1.        … Read More
  • DELETION FROM A LINKED LIST DELETION FROM A LINKED LIST :   Let LIST be a linked list with a node N between nodes A and B Suppose node N is to be deleted from the linked list.The schematic diagram of such a deletion appears.The deletion… Read More
  • DELETION FROM A LINKED LIST DELETION FROM A LINKED LIST :   Let LIST be a linked list with a node N between nodes A and B Suppose node N is to be deleted from the linked list.The schematic diagram of such a deletion appears.The deletion… Read More

0 comments:

Post a Comment