{"id":6386,"date":"2017-05-17T04:00:47","date_gmt":"2017-05-17T04:00:47","guid":{"rendered":"https:\/\/assignment.essayshark.com\/blog\/?p=6386"},"modified":"2022-01-11T14:59:33","modified_gmt":"2022-01-11T14:59:33","slug":"c-stack-example-lifo-stack","status":"publish","type":"post","link":"https:\/\/assignmentshark.com\/blog\/c-stack-example-lifo-stack\/","title":{"rendered":"C++ Stack Example: LIFO Stack"},"content":{"rendered":"

Hello! In this guide, I want to tell you about one of the most widely used data structures in C++. This is a type called Stack.<\/p>\n

The stack is a data structure organized on the principle of LIFO (last in \u2013 first out). It\u2019s usually compared with a gun clip \u2013 the shooting starts from the last bullet. It looks like this:<\/p>\n

\"\"<\/a><\/p>\n

So, let\u2019s start the implementation:<\/p>\n

First we should create our data structure:<\/p>\n

[code language=”cpp”]
\nstruct number {
\n\tint value; \/\/ value of the element
\n\tnumber *next; \/\/ pointer to the next element
\n}
\n[\/code]<\/p>\n

Create two pointers of number type:<\/p>\n

[code language=”cpp”]
\nnumber *top = NULL, *p;
\n[\/code]<\/p>\n

Now assume that we will read the values from the text file:<\/p>\n

[code language=”cpp”]
\ndo {
\n\tp = new number; \/\/ create a new element
\n\tp->next = top; \/\/ create the pointer to the previous element
\n\tfile >> p->value; \/\/ read the value from the file
\n\ttop = p; \/\/ move the stack\u2019s head
\n} while (top->value); \/\/ repeat the cycle until the document is over
\nNow we are able to read our stack. Let\u2019s try to insert some value inside the stack:
\np = top; \/\/ use a temporary pointer for the head of the stack
\nwhile (p->value != 7 || p->next != NULL) { \/\/ move to the needed value
\n\tp = p->next;
\n}
\nnumber *new_el = new number; \/\/ create a new element
\nnew_el->value = 15; \/\/ set the value
\nnew_el->next = p->next; \/\/ create a pointer to the next element
\np->next = new_el; \/\/ create a pointer to the previous element<\/p>\n

Now let\u2019s try to delete some element:
\nwhile (p->value != 7 || p->next != NULL) { \/\/ move to the needed value
\n\tp = p->next;
\n}
\nnumber *p2 = p->next; \/\/ save the address of the element to the new pointer
\np->next = p->next->next; \/\/ assign it with the next element
\ndelete p2; \/\/ delete element
\n[\/code]<\/p>\n

Now we are able to create a dynamic data structure called stack, read it from the text file, insert some values inside of it and delete them.<\/p>\n

Thanks for the attention!<\/p>\n

Our C stack example gives you the opportunity to complete your own homework successfully. But don’t hand in our sample as your own assignment. The goal of our example is to help you with your homework of a similar topic (by the way, you can check one more C++ sample here<\/a>). If you can’t do your task, AssignmentShark.com can do it for you. Don’t leave incomplete tasks, as there are experts who can deal with them easily.<\/em><\/p>\n

Our service always remains safe \u2013 your personal data will be secure and never passed to third parties. Each student can use our service, as we have affordable prices. We are available 24\/7, so you can contact us any time you need. When you have a lot of work to do, leave it to our site. Our experts can deal with any topic and assignment of any difficulty.<\/em><\/p>\n

When you are placing an order on our site, mention your requirements and set the deadline. Testimonials on our site show that we do everything possible to satisfy our customers’ needs. The job of our service is to provide online assignment help<\/a> for students to solve their problems with homework.<\/em><\/p><\/blockquote>\n","protected":false},"excerpt":{"rendered":"

Hello! In this guide, I want to tell you about one of the most widely used data structures in C++. This is a type called Stack. The stack is a data structure organized on the principle of LIFO (last in \u2013 first out). It\u2019s usually compared with a gun clip \u2013 the shooting starts from […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[53,35],"tags":[],"class_list":["post-6386","post","type-post","status-publish","format-standard","hentry","category-it","category-samples"],"_links":{"self":[{"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/posts\/6386","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/comments?post=6386"}],"version-history":[{"count":7,"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/posts\/6386\/revisions"}],"predecessor-version":[{"id":12979,"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/posts\/6386\/revisions\/12979"}],"wp:attachment":[{"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/media?parent=6386"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/categories?post=6386"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/assignmentshark.com\/blog\/wp-json\/wp\/v2\/tags?post=6386"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}