{"id":494,"date":"2023-02-13T02:40:29","date_gmt":"2023-02-13T02:40:29","guid":{"rendered":"https:\/\/aipsacademy.com\/blogs\/?p=494"},"modified":"2023-02-13T02:40:31","modified_gmt":"2023-02-13T02:40:31","slug":"stack-data-structure-in-cintroduction-algorithm-program","status":"publish","type":"post","link":"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/stack-data-structure-in-cintroduction-algorithm-program\/","title":{"rendered":"Stack Data structure in C++(Introduction, Algorithm, Program)"},"content":{"rendered":"\n<p><strong>What is STACK ?<\/strong><strong><\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\"><li><strong>Stack<\/strong>&nbsp;is a liner data structure.it means elements in this data structure have a unique predecessor and a unique successor.<\/li><li><strong>Stack follows<\/strong>&nbsp;Last In First Out&nbsp;<strong>(LIFO<\/strong>) technique.<\/li><li>Initial value of Top is -1 which is known as centennial value.<\/li><li><strong>When&nbsp;<\/strong>new Element is inserted then top is incremented by one and this term is known as PUSH.<\/li><li><strong>When&nbsp;<\/strong>&nbsp;an element is deleted then top is decremented by one and this term is known as POP.<\/li><li><strong>When&nbsp;<\/strong>there is no space for inserting new element and we try to insert then what situations comes known as stack overflow i.e no space for insertion.<\/li><li><strong>When&nbsp;<\/strong>there is<strong>&nbsp;no element<\/strong>&nbsp;in stack and&nbsp;<strong>we try to delete&nbsp;<\/strong>then what situations comes known as stack<strong>&nbsp;underflow<\/strong>&nbsp;i.e no element for deletion.<\/li><li><strong>When&nbsp;<\/strong>stack is<strong>&nbsp;full<\/strong>&nbsp;then top will be at&nbsp;<strong>size-1<\/strong>.<\/li><li><strong>Stack&nbsp;<\/strong>can be represented or implemented in two ways.<\/li><li><strong>Stack as an&nbsp;<\/strong><a href=\"https:\/\/www.nipsacademy.com\/blogs\/arrays-in-c-language\/\"><strong>array<\/strong><\/a><\/li><li><strong>Stack as a linked list<\/strong><\/li><\/ul>\n\n\n\n<p><strong>Algorithm: PUSH Operation on Stack<\/strong><strong><\/strong><\/p>\n\n\n\n<p>Step 1:<strong>&nbsp;If Top=Max-1<\/strong><\/p>\n\n\n\n<p><strong>Print \u201cOverflow : Stack is full\u201d and Exit<\/strong><\/p>\n\n\n\n<p><strong>End If<\/strong><\/p>\n\n\n\n<p>Step 2:&nbsp;<strong>Top=Top+1<\/strong><\/p>\n\n\n\n<p>Step 3:&nbsp;<strong>Stack[TOP]=Element<\/strong><\/p>\n\n\n\n<p>Step 4:&nbsp;<strong>End<\/strong><\/p>\n\n\n\n<p><strong>Algorithm: POP Operation on Stack<\/strong><\/p>\n\n\n\n<p>Step 1:&nbsp;<strong>If TOP=-1<\/strong><\/p>\n\n\n\n<p><strong>Print \u201cUnderflow: Stack is empty\u201d and Exit<\/strong><\/p>\n\n\n\n<p><strong>End if<\/strong><\/p>\n\n\n\n<p>Step 2:<strong>&nbsp;Set Del_element=Stack[Top]<\/strong><\/p>\n\n\n\n<p>Step 3:&nbsp;<strong>Top=Top-1<\/strong><\/p>\n\n\n\n<p>Step 4:&nbsp;<strong>Return<\/strong>&nbsp;<strong>Del_Element<\/strong><\/p>\n\n\n\n<p>Step 5:&nbsp;<strong>End<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>What is STACK ? Stack&nbsp;is a liner data structure.it means elements in this data structure have a unique predecessor and a unique successor. Stack follows&nbsp;Last In First Out&nbsp;(LIFO) technique. Initial value of Top is -1 which is known as centennial value. When&nbsp;new Element is inserted then top is incremented by one and this term is [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":495,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,3,9,8],"tags":[],"class_list":["post-494","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-12th-computer-science","category-bca","category-cbse-12th-computer-science","category-jac-12th-computer-science"],"_links":{"self":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/494","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/comments?post=494"}],"version-history":[{"count":1,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/494\/revisions"}],"predecessor-version":[{"id":496,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/494\/revisions\/496"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media\/495"}],"wp:attachment":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media?parent=494"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/categories?post=494"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/tags?post=494"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}