This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<stdlib.h> | |
| #include<iostream> | |
| using namespace std; | |
| // Creating a NODE Structure | |
| struct node | |
| { | |
| int data; | |
| struct node *next; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<stdlib.h> | |
| #include<iostream> | |
| using namespace std; | |
| // Creating a NODE Structure | |
| struct node | |
| { | |
| int data; | |
| struct node *next; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include<stdlib.h> | |
| #define max 5 | |
| int top=-1,item; | |
| using namespace std; | |
| /* push*/ | |
| void push(int stack[] ,int item) | |
| { | |
| top++; |
NewerOlder