Amazon Interview Question
Country: India
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 votes
I'd like to point out that while code is nice (especially if it's tested, working code), it is important to include an English-language description of algorithms because reading code can be tedious.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
#include<conio.h>
- Hector December 17, 2011#include<stdio.h>
struct node
{
int data;
struct node*link;
};
void push(struct node**,int);
int get_min(struct node**top);
// void pop();
int main()
{
struct node*st;
int n;
st=NULL;
push(&st,8);
push(&st,7);
push(&st,6);
push(&st,5);
push(&st,3);
n= get_min(&st);
printf("%d",n);
getch();
}
int get_min(struct node**top)
{
struct node*temp,*next;
temp=*top;
while(temp!=NULL)
{
next=temp->link;
if(temp->data<next->data)
{
next->data=temp->data;
}
temp=temp->link;
}
return temp->data;
}
void push(struct node **p,int num)
{
struct node*temp;
temp=(struct node*)malloc(sizeof(struct node));
if(temp==NULL)
{
printf("stack is full");
}
temp->data=num;
temp->link=*p;
*p=temp;
}