3.3 Stack implementation using Linked List | Data Structures and Algorithm Tutorials

preview_player
Показать описание
Here I have discussed Linked List implementation of Stack Data Structure. I have written a C program for Implementation of Stack using Linked List.

******************************************
See Complete Playlists:

*********************************************

Connect & Contact Me:

#stack
#UGCNET
#jennyslectures
#datastructures
#computerscience
Рекомендации по теме
Комментарии
Автор

I am totally suprised she has completed the whole datastructures series wther cith full explanation anyone can clear there concepts very easily if they have paitience aap ko mera pranam guruji

shreyashsharma
Автор

For back benches, this is very helpful in Last time exam preparation 🤪
Thank you mam
Keep it
If you are my class teacher for data structure, I score first🥇 rank
Again, Thank a lot

harshil
Автор

This is the best YouTube channel on earth. I learnt C on this channel, now i am learning Data Structure, i will soon learn Database and other modules. Mam, you are my Ada Lovelace forever. You are better than our lecturers.

abdulrahimjalloh
Автор

Your lectures are best dii it's helping me so much... Lots of love

devanshipokalkar
Автор

Mam I m luckky I got all lectures ... And this channel have all lectures available ... Thank u mam.... GOD BLESS YOU....

AR-nwdv
Автор

Ma'am by 14:48 you wrote newnode-> next
I think that is newnode-> link
Because there is no available of
struct node *next; in declaration
Any one find it correct please reply 😊....

Karthik-syf
Автор

Feeling relaxed😊 after watching these lectures because I have cleared all of my queries related to stack . Thank you so much .Thumbs up for her 👍.

weloveyouhussain
Автор

You always exhaust my questions, precise and to the point. Thank you, your students must be brilliant

kennedykalaluka
Автор

Your teaching method is so simple and easy to understand ..i wish i had a professor like you...n youtube is full of paid courses..they dont teach deeply on YouTube now and yet you teach so brilliantly...thanku ma'am for these❤️

indrajeetverma
Автор

All legends are watching this video in last day of exam 😂

sxjeed
Автор

thanks maam i think like & comments are very cheap for your teaching appreciation .
Respect from Pakistan .

kashifahmed
Автор

Your lectures are best . so continue to upload more examples of data structure.

jaykumarpatel
Автор

Here is a suggestion, You should give the running code of these programs, in description, because we are having some errors in implementations

moizmirza
Автор

00:05 Implementing stack using linked list
02:18 Stack implementation using Linked List
06:45 Implementing stack using linked list
09:07 Implementation of stack using linked list
13:32 Dynamic memory allocation using malloc function in a linked list implementation of the stack
15:51 Implementation of a stack using linked list
20:15 Stack implementation using Linked List
22:31 Stack implementation using Linked List
26:59 Stack implementation using Linked List
Crafted by Merlin AI.00:05 Implementing stack using linked list
02:18 Stack implementation using Linked List
06:45 Implementing stack using linked list
09:07 Implementation of stack using linked list
13:32 Dynamic memory allocation using malloc function in a linked list implementation of the stack
15:51 Implementation of a stack using linked list
20:15 Stack implementation using Linked List
22:31 Stack implementation using Linked List
26:59 Stack implementation using Linked List

vigneshmasani
Автор

Best video I’ve seen so far. You convey your idea in very simple words! Thanks for the video!

retrohd_
Автор

So now = सुनो 🤣.. Appreciate much.. very best lectures on DS I have ever seen.. clear and concise... Way to go 👍

hirubalanpalanichamy
Автор

Thank you ma'am it is very helpful in 2021 your teaching level is excellent. You are the best teacher everything I have to learned from your lectures.
Regard from Pakistan

nizamanitechnical
Автор

I have never seen such amazing teacher before

DSEC-LuckyUpadhyay
Автор

Note: this worked for me. if there is any mistake, please let me know.
Code for C++:
#include <iostream>
using namespace std;

struct node
{
int data;
struct node *link;
};
struct node *top = 0;

void push()
{
int number;
cout << "Enter your number" << endl;
cin >> number;
struct node *newnode;
newnode = (struct node *)malloc(sizeof(struct node));
newnode->data = number;
newnode->link = top;
top = newnode;
}

void display()
{
struct node *temp;
temp = top;
if (top == 0)
{
cout << "The stack is empty" << endl;
}
else
{
while (temp != 0)
{
cout << temp->data << endl;
temp = temp->link;
}
}
}

void pop()
{
struct node *temp;
temp = top;
if (top == 0)
{
cout << "Empty Stack";
}
else
{
cout << top->data;
top->link;
free(temp);
}
}

void peek()
{
if (top == 0)
{
cout << "Empty Queue";
}
else
{
cout << top->data << endl;
}
}
int main()
{
int choice;
do
{
cout << "Enter your choice :\n1. PUSH\n2. POP\n3. PEAK\n4. DISPLAY";
cout << " " << endl;
cin >> choice;
switch (choice)
{
case 1:
push();
break;
case 2:
pop();
break;
case 3:
peek();
break;
case 4:
display();
break;
default:
cout << "Invalid choice"<<endl;
break;
}
} while (choice != 0);
return 0;
}

cyanider
Автор

this is where i have found answer to all my questions. Definitely the kind of lectures i have always looked up to. Can't express my appreciation for your teaching

as_if