Commit 575db1b

authored

Merge pull request fnplus#348 from tush38/my-new-feature

Stack.CPP: Add Stack in C++

2 parents f722f13 + 8c5d8eb commit 575db1bCopy full SHA for 575db1b

File tree

+62

-0

lines changed

+62

-0

lines changed

Lines changed: 62 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,62 @@`
	`1`	`+#include <iostream>`
	`2`	`+using namespace std;`
	`3`	`+`
	`4`	`+// class to represent a stack node`
	`5`	`+class StackNode {`
	`6`	`+ public:`
	`7`	`+ int data;`
	`8`	`+ StackNode* next;`
	`9`	`+ };`
	`10`	`+`
	`11`	`+StackNode* newNode(int data) {`
	`12`	`+ StackNode* stackNode = new StackNode();`
	`13`	`+ stackNode->data = data;`
	`14`	`+ stackNode->next = NULL;`
	`15`	`+ return stackNode;`
	`16`	`+ }`
	`17`	`+`
	`18`	`+int isEmpty(StackNode *root) {`
	`19`	`+ return !root;`
	`20`	`+ }`
	`21`	`+`
	`22`	`+void push(StackNode** root, int new_data){`
	`23`	`+ StackNode* stackNode = newNode(new_data);`
	`24`	`+ stackNode->next = *root;`
	`25`	`+ *root = stackNode;`
	`26`	`+ cout<<new_data<<endl;`
	`27`	`+ }`
	`28`	`+`
	`29`	`+int pop(StackNode** root){`
	`30`	`+ if (isEmpty(*root))`
	`31`	`+ return -1;`
	`32`	`+ StackNode* temp = *root;`
	`33`	`+ root = (root)->next;`
	`34`	`+ int popped = temp->data;`
	`35`	`+ free(temp);`
	`36`	`+`
	`37`	`+ return popped;`
	`38`	`+}`
	`39`	`+int peek(StackNode* root)`
	`40`	`+{`
	`41`	`+ if (isEmpty(root))`
	`42`	`+ return -1;`
	`43`	`+ return root->data;`
	`44`	`+}`
	`45`	`+`
	`46`	`+int main()`
	`47`	`+{`
	`48`	`+ StackNode* root = NULL;`
	`49`	`+ cout<<"Stack Push:"<<endl;`
	`50`	`+ push(&root, 100);`
	`51`	`+ push(&root, 200);`
	`52`	`+ push(&root, 300);`
	`53`	`+ cout<<"\nTop element is "<<peek(root)<<endl;`
	`54`	`+ cout<<"\nStack Pop:"<<endl;`
	`55`	`+ while(!isEmpty(root)){`
	`56`	`+ cout<<pop(&root)<<endl;`
	`57`	`+}`
	`58`	`+`
	`59`	`+cout<<"Top element is "<<peek(root)<<endl;`
	`60`	`+`
	`61`	`+return 0;`
	`62`	`+}`

Comments

(0)