Answer Posted / sumit garg( jmit mca)

\\HELLO FRIENDS CHEK THIS...IT IS TESTED\\
struct node
{
int info;
struct node * next;
};
struct node * ptr=NULL,* old=NULL,*save=NULL;
void reverse()
{
old=ptr=start;
while (ptr!=NULL)
{
ptr=ptr->next;
old->next=save;
push(old);
save=old;
old=ptr;
}
}
void push(struct node * p)
{
top++;
stack [top]=p;
}
struct node * pop()
{
struct node * ret=NULL;
ret=stack[top];
top=top-1;
return ret;
}
display(struct node * disp)
{
disp=stack[top];
while (disp->next!=NULL)
{
disp=pop();
printf("%d",disp->info);
}

How do you find the space complexity of a bubble sort?

884

---

What is the Difference between treemap and hashmap?

1043

---

What is integer max_value?

924

---

What you mean by sorting?

979

---

What is difference between arraylist and linkedlist?

1087

---

Is treeset sorted?

1017

---

Questions related to arrays, such as given a 2 integer array, find the common elements.

980

---

Explain exception filter?

1011

---

What do you mean by Logical Error

1086

---

Explain pre-order and in-order tree traversal.

993

---

Tell me how to find middle element of linked list in one pass?

954

---

What is dynamic array how is it created?

936

---

Does linked list allow duplicates?

942

---

Is it possible to increase size of array?

999

---

What is bubble insertion selection sort?

933

---