Reverse a string or linked list using stack. 

bhai bhai bhai bhai bhai bhai

did you create this meme "bhai bhai bhai bhai" :o

sonu sonu you are the creater of arey bhai bhai meme , salute respeccc

Vinod

@@rishabhvarshney7522 O MY Binod!!!! Binod is also here............im fainting

But he is here..

In print function can't we declare a stack and pick all the elements form linked list into stack & print them

@@ravenx You could dereference the address of each pointer in the stack and print the data field of it

blog.mycodeschool.com/ he's not dead his teammate died in a hit and run case in bangalore in 2014!!

its been a while...

@@HARIHaran-ks7wp Complete series is finished go and check their playlist

Priya Kokas Good Job.....!!!

Great!

Dream On tell me one thing,how can you fetch elements of stack that was pushed very first in stack? Its last in first out.

if(top == -1){ printf("Error: stack is empty "); return; } mistake fixed :)

correct code in c to reverse string using stack: #include #include #include void push(char a); void pop(); void print(); struct node{ char data; struct node *next; }; struct node *top=NULL; char a[10]; void push(char a) { struct node *temp=(node *)malloc(sizeof(struct node)); temp->data=a; temp->next=NULL; if(top==NULL) { top=temp; return; } temp->next=top; top=temp; } void pop() { printf("Reverse string:"); while(top!=NULL) { struct node *temp=top; static int i=0; a[i]=top->data; i++; top=top->next; free(temp); } } void print() { struct node *temp=top; printf("string on stack:"); while(temp!=NULL) { printf("%c",temp->data); temp=temp->next; } printf(" "); } int main() { int i; printf("Enter string: "); gets(a); for(i=0;a[i]!='\0';i++) { push(a[i]); } print(); pop(); puts(a); }

same thing at 11:05

theilluminati77 I have the same problem

go through book :- balaguruswamy for c++

@@forbiddenumbrella I think he had learnt c++ in last two years😂

Both are almost same

C++ is just the Incremented version of C. Both possess some similarities

thanks man but why we have to use malloc every time we want to push (node temp=(node)malloc(sizeof(node));)??? isnot it waste of memory?

@amateur_beginner, malloc function allocates memory during runtime and thus saves the wastage of memory. Push means Insert and malloc will allocate (sizeof(node)) only for each value you want to push.

do you know where can i find dynamic programming videos?

Its on his channel watch the pointers and dynamic allocation series

He's dead

Because Knowledge Is Power

@@muhammadbilalmalik7292 😮

ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-D6xkbGLQesk.html

yes as mentioned it is not available in description

pointer arithmetic in C for arrays are based on the type of that array. I haven't watched the previous video you are referring to but I can make an educated guess and say that he was talking about an integer array. Int's in C are typically 4 bytes long, which is why it is ..+4*(n-1). In this video, he is talking about char, which are 1 byte in size. Thus, 400, 401, ... 404. Hope that helps.

This is not his source code, but feel free to see mine : repl.it/EbXh/7

It is Present in His Grave...Go and Get also share with Us!!

@@muhammadbilalmalik7292 he is not head ...his name is animesh ..and his friend harsha died in a car accident ...animesh is in san francisco working for google and has stopped making videos

Naveena Null Character is Attacked by Corona Virus ,,,Pray for it's health!!

Yes

He's using C in this video.

@@FatmaYousuf lol

Sai Nivedh Vallala yeah totally funny

yes i have added check top comment

I'm not sure my answer is 100% correct but i'll try... I'm taking the simplest example which is our linked list identity HEAD..We firstly initialize the variable HEAD as Node* head = NULL...After inserting a new node in the list we will have head = temp ( temp being also a pointer variable Node* temp (c++)/ struct Node* temp (c) )...Our output til' now is HEAD - > TEMP - > NULL .. In my opinion temp and temp->next in this case are the same thing and both statements are correct. Through the initialization of temp as Node* this variable will take in consideration JUST the own address ( IN CASE YOU DON'T DEREFERENCE IT such as: (*temp).data )..in our case being the last in the linked list is NULL which is equal if i'm saying temp->next which also is pointing to NULL ( conclusion: both are pointing to NULL or making a reference to NULL )...hope you understand it.

naah!! they are not same we use temp!=null to go to nth position or in case of traverse (we use this to go to last node) while temp->next!=null is used to go to n-1th node or in case of traversing(it is used to go to second-last node) hope u understand:)

Thanks...

Hope I am not too late. If you use the first while condition by the end of the loop your temp variable will have address pointing to 0 i.e it will travel through the whole linked list. But if use the second condition the temp variable will point to the last node and it won't travel the last node for display function that he has been writing in his examples

unfortunately, Animesh is no more with us. RIP .

@@pup_lover not true. Its the other co-founder Harsha S who dies in an unfortunate accident. tiptechtales.com/2017/08/13/humblefool-greatest-coder-india-has-ever-produced/

@@pup_lover Half knowledge is dangerous.

I am His Close Friend...Availaible for Service on Behalf of my Best Friend!!!

@@muhammadbilalmalik7292 Hello sir I am Rishabh from IIT Mandi

// C++ Full code Push at the head/tail, Pop at the head/tail, Reverse, Print // LInk : repl.it/EbXh/7 #include #include #include #define MAX_SIZE 50 int A[MAX_SIZE]; struct Node { int data; struct Node* link; }; struct Node* top = NULL; void push_head(int x) { struct Node* temp = new Node(); temp->data = x; temp->link = top; top = temp; } void push_tail(int x) { struct Node* temp = top; while (temp->link != NULL) { temp = temp->link; } temp->link = new Node; // returns a pointer to the new node temp->link->data = x; temp->link->link = NULL; } void pop_head() { struct Node* temp; //no node necessary if (top == NULL) return; temp = top; top = top->link; free(temp); } void pop_tail() { struct Node* temp = top; struct Node* prev = NULL; while (temp->link != NULL) { prev = temp; temp = temp->link; } free(temp); prev->link = NULL; } void print() { Node* temp = top; while (temp != NULL) { printf("%d ", temp -> data); temp = temp -> link; } printf(" "); } void reverse() { // Time O(N), Space O(1) if (top == NULL) return; std::stack S; //create a stack called S Node* temp = top; while (temp != NULL) { S.push(temp); //LIFO temp = temp->link; } temp = S.top(); //now temp is pointing at the last inserted element on the stack or the TOP top = temp; // head points at the same element S.pop(); //clear up the element from top of the stack while(!S.empty()) { temp->link = S.top(); //point temp to the previous element in the linked list, or the element at the top S.pop(); // clear up that element fromt the stack temp = temp->link; } temp->link = NULL; } int main() { push_head(2); print(); // output 2 push_head(6); print(); // output 6 2 push_head(9); print(); // output 9 6 2 pop_head(); print(); // output 6 2 push_tail(8); print(); // output 6 2 8 pop_head(); print(); // output 2 8 pop_tail(); push_tail(3); print(); // output 2 3 push_tail(5); print(); // output 2 3 5 pop_tail(); print(); // output 2 3 push_head(6); push_tail(19); push_tail(55); print(); // output 6 2 3 19 55 reverse(); print(); // output 55 19 3 2 6 }

What is the use of the array A in your code?

ru-vid.com/group/PL7Lpn-y30qDvSaj0DxrS5_5-3dEdL_3zw check here for code if you like please subscribe to this channel

ru-vid.com/group/PL7Lpn-y30qDvSaj0DxrS5_5-3dEdL_3zw check here for coding in C if you like please subscribe to this channel

here u go :) --> #include #include #include #define max 20 char a[max]; int top = -1; void push(char z) { top++; a[top] = z; } void firstelenow() { printf("%c",a[top]); } void pop() { top = top-1; printf("%c",a[top]); } int main() { int n,i; char c[20]; printf(" enter the string "); gets(c); n = strlen(c); for(i= 0 ; i

Hitesh Singhal I used C++, but it's not a big difference. I don't use stack from standard template library, I've written my own implementation instead. I am a newbie, too. So, it would be great if somebody could check my code. #include using namespace std; struct node { // node has 2 fields int data; // this field stores data node* link; // this field stores address of the next node in the list }; struct stack { // my stack implementation using linked list node* node; // stores address of a node stack* next; // used for getting back to the previous stack node when popping }; stack* top = NULL; // pointer to the top of stack node* head; // pointer to the head node in the linked list, initialized in main() void Insert(int x) { // Inserts a node at the end of the linked list node* temp = new node; temp->data = x; temp->link = NULL; if (head == NULL) { head = temp; return; } node* temp1 = head; while (temp1->link != NULL) { temp1 = temp1->link; } temp1->link = temp; } void Print() { // prints nodes in the linked list node* temp = head; while (temp != NULL) { cout data link; } cout node = current; // saving address of the node from the linked list temp->next = top; top = temp; } void Pop() { if (top == NULL) { cout link = Top(); temp = temp->link; Pop(); } temp->link = NULL; } int main() { head = NULL; Insert(2); Insert(3); Insert(7); Insert(9); Insert(11); cout

Peter Masica .. great work man

use strlen instead of sizeof , happy coding

I meant for linked lists

Long tee see my post above

Priya Kokas Thank you a lot,i was looking for this:)

i cant find your post

Priyank Bhardwaj he's dead

Priyank Bhardwaj ikr

he's dead...

You mean he is no more?

yes he is no more.

Are you really out of your mind?