Big big big salute for ur work mam.I became ur student in this week and I had watched all ur videos of datastructure.And honestly saying mam,I didnt opened my notes for revision I just went through ur videos
Wah wah salute to you also you watched all videos in a week. How you managed time for watching videos in day and night that you completed the playlist.
I am from Pakistan and I have learned all course of data structure from uh .thankuu so much mam 🤞🤞🥰🥰🥰❤️method of teaching is Auesome and ur voice also attracts me 😍😍😍😍😍😍😍Allah bless uh 💞💞🥰🥰🥰❤️🥰🥰🥰🥰🥰🥰🥰
Maam..thankyou soooo much This is actually not enough to thank u. Your explanations are amazing. I studied my whole algo book using ur lectures nly. And It wont be possible with out you. Thank you very much madam. Keep uploading a lot maam....🙂🙂
You have great mind and also help all .. keep doing nd god take more energy nd strength to make more good videos for ourselves... thank you 😊 so much !!!!
Detail analysis of program to insert a node at nth position in a Doubly Linked list. Please like and share. ua-cam.com/video/IhzfO3M4kbA/v-deo.html&ab_channel=SHASHANKJHA
if You add the screenshot of the above code with the description ,then it will be more helpful for the new learner to understand and will save a lot time of student....i hope you will implement this change......
mam I see this video for my seminar it was very helpful for me thank you so so much mam and I will seen some of the video's that is also helpful to understand mam once again thank you mam
Hello Ma'am, in data structures playlist before 7th april there were 116 videos, but now there are 114 videos . Ma'am i think you missed two videos of graphs . By the way, thank you so much ma'am for keeping all the data structure content in one playlist .
Mam please show us the total compilation and output in a code editor and make a seperate video because while typing code myself it is not executing at all. Please 🙏😭
write a program for Doubly linked list with insertion. Code:- class Node: def __init__(self, data): self.data = data self.next = None self.prev = None class DoublyLinkedList: def __init__(self): self.head = None # Insert node at the front def insert_front(self, data): new_node = Node(data) new_node.next = self.head if self.head is not None: self.head.prev = new_node self.head = new_node # Insert a node after a specific node def insert_after(self, prev_node, data): if prev_node is None: print("Previous node cannot be null") return new_node = Node(data) new_node.next = prev_node.next prev_node.next = new_node new_node.prev = prev_node if new_node.next: new_node.next.prev = new_node # Insert a new node at the end of the list def insert_end(self, data): new_node = Node(data) if self.head is None: self.head = new_node return temp = self.head while temp.next: temp = temp.next temp.next = new_node new_node.prev = temp # Print the doubly linked list def display_list(self, node): while node: print(node.data, end="->") node = node.next # Initialize an empty doubly linked list d_linked_list = DoublyLinkedList() d_linked_list.insert_end(5) d_linked_list.insert_front(1) d_linked_list.insert_front(6) d_linked_list.insert_end(9) # Insert 11 after head d_linked_list.insert_after(d_linked_list.head, 11) # Insert 15 after the second node d_linked_list.insert_after(d_linked_list.head.next, 15) # Display the list d_linked_list.display_list(d_linked_list.head) print() d_linked_list.display_list(d_linked_list.head)
Best channel because if I have not understand my faculty lecture then I used to watch these channel
*1 million* subscriber deserve this channel. I hope she will.
Form nepal☝️☝️your videos are so informative that most of the student from our class watch it.thank u mam
Very informative, and detailed explanation within a limited time constraint!!
Worth the Praise!! 🙌🏻
Big big big salute for ur work mam.I became ur student in this week and I had watched all ur videos of datastructure.And honestly saying mam,I didnt opened my notes for revision I just went through ur videos
Wah wah
salute to you also you watched all videos in a week. How you managed time for watching videos in day and night that you completed the playlist.
The best channel for learning DSA. Thank you ma'am for all these efforts.
I am from Pakistan and I have learned all course of data structure from uh .thankuu so much mam 🤞🤞🥰🥰🥰❤️method of teaching is Auesome and ur voice also attracts me 😍😍😍😍😍😍😍Allah bless uh 💞💞🥰🥰🥰❤️🥰🥰🥰🥰🥰🥰🥰
jay shree Ram
@@riteshkatare1433 ☠
Jenny lecture one of the best UA-cam channel for DSA
Helpful video
Thanks a lot .
Maam..thankyou soooo much
This is actually not enough to thank u. Your explanations are amazing. I studied my whole algo book using ur lectures nly. And It wont be possible with out you. Thank you very much madam.
Keep uploading a lot maam....🙂🙂
Its a trade off. You win some you lose some. This is pretty much similar to hashes in a block chain.
Good explanation 👍
You have great mind and also help all .. keep doing nd god take more energy nd strength to make more good videos for ourselves... thank you 😊 so much !!!!
Mam I wish you would be in our college as a lecturer 🥰
Ahaaaannn😂😂
Ohh,hhhh..😜
Detail analysis of program to insert a node at nth position in a Doubly Linked list.
Please like and share.
ua-cam.com/video/IhzfO3M4kbA/v-deo.html&ab_channel=SHASHANKJHA
yess
Tharkiyo 🤣🤣🤣🤣
Excellent lecture 😍💯 ma'am you are my third semester teacher in data structures .... From Banasthali
@@nishajain6025 samee bruh😑
you teach so much better than my professors. thank you!
I don't have a professor.
Thanks mam
you are real god of datastructure
at the last before ending the lecture you give katilana smile ma'am love u.
That smile at last has broken all hearts and stress
U made me love DS🤩
Watching from Kashmir on 2g network !
Like it .
Same here😅😅
From iit kanpur.... Next level explanation.... 😍😍love it
great video mam. respect from Pakistan.
Our dbms faculty suggested your channel and here i am watching your dsa videos 😅
Thank you so much madam. These videos really helped me a lot.
I know you are playing this lecture video at 1.5x speed. Because tomorrow is your Exam.
😅💯
😅
@@sawelmohammad6 hey don't reveal my secrets
2x
if You add the screenshot of the above code with the description ,then it will be more helpful for the new learner to understand and will save a lot time of student....i hope you will implement this change......
Excellent work Jenny ...
Gr8 explanations !!!!!
Menu driven( inserion of elements , traversal, insertion at desired position, deletion and reversal ) C++ code of double linked list
#include
using namespace std;
struct node
{
int data;
node *next;
node *prev;
};
node *newnode,*head=0,*tail=0,*temp;
node *currentnode,*nextnode;
class linkedlist
{
int value;
int position;
int count;
public:
void insertelement()
{
coutvalue;
newnode=new node;
newnode->data=value;
newnode->next=NULL;
newnode->prev=NULL;
if(head==0)
{
head=tail=newnode;
}
else
{
tail->next=newnode;
newnode->prev=tail;
tail=newnode;
}
}
void traverse()
{
if(head==NULL)
{
coutprev=NULL;
head->prev=newnode;
newnode->next=head;
head=newnode;
}
else
if(position==( noofelements()+1) && head!=NULL)
{
newnode->data=value;
newnode->next=NULL;
newnode->prev=NULL;
tail->next=newnode;
newnode->prev=tail;
tail=newnode;
}
else
if( (position < noofelements() ) && head!=NULL)
{
int i=1;
temp=head;
while(inext;
i++;
}
newnode->next=temp->next;
newnode->prev=temp;
temp->next=newnode;
newnode->next->prev=newnode;
newnode->data=value;
}
else
coutprev=NULL;
head->next=NULL;
coutprev;
cout
Purpose of uploading this?????
@siddharth verma thank you much for uploading the code
@@amitsahgal2000 to show off his coding skills 😂😂
Please upload for SLL and CLL
@@varunrawat599 you can also show off no one stopping you
mam I see this video for my seminar it was very helpful for me thank you so so much mam and I will seen some of the video's that is also helpful to understand mam once again thank you mam
Nice..
Hey, how do you manage to upload one video daily??
Excellent teaching madam and keep it up
keep uploading plz do'nt stop
Thank you ma'am for this lecture
Hello Ma'am, in data structures playlist before 7th april there were 116 videos, but now there are 114 videos . Ma'am i think you missed two videos of graphs . By the way, thank you so much ma'am for keeping all the data structure content in one playlist .
Wo kis topic pr videos thi btye ga zara please.
@@farzanaashraf8136 ok
Now there are only 112 😶😶
@@sairakeshreddy3767 amazing my friend
Nice Teaching Mam!!!!
Really Awesome!
Thanks you use to make things sooooo.. interesting
Write an Algorithm for push and pop
I like to attend your lecture everyday
Tq maam for this video👌👌👌
Very nice teaching style and you also... 😉
Tq so so so much..mam for tis videos👌👌👍👍👍👏🙏🙏🙏🙏🙏🙏..please put videos on stack.. in data structures
working on stacks
Very helpful video,thank you ma'am.
Ma'am but 0 is a valid entity so we can't say it as a NULL .
Nice teaching 👍🏼
Thankyou mam for videos....
Thank you mam...god bless u
Happy diwali mam , God bless you
Good teaching
Thanks mam🤓
Great vídeo!
crystal clear
thank you
Thanks 😊
best contens madam i like you your teching the contence so swite
Mam please come as lecturer to our collage.😐
wow! what an explanation
thanks maam
really thank you so much
love from Nepal
Very information thnx mam
Nice perception
Explore quick sort technique with an example...
Already uploaded
Thank u mam.
First node is called headnode
Nice mam thank you
mam please make videos on recursion and all techniques how to solve problems using recursion
Thank you
If(jenny==tammana)
{
Printf("why we need tamanna");
}
Thank you so much mam.
Day 13 completed
Mam i wish u would be doing lecture in our clg y u left😩😭
Mam aapki video dekhte dekhte mn hi nahi bhrta lekin jyada pdhne ka bhi mn nahi krta 😂😂
In order tree traversal of a binary tree
Mam please show us the total compilation and output in a code editor and make a seperate video because while typing code myself it is not executing at all. Please 🙏😭
Beautiful
Thanx mam
thanks didi
Please video on 12 lab programs in ds
Mam, in coding platforms like leetcode or in gfg the headnode is actually containing a value to it , there is no pointer that points to the head node
धन्यवाद
🇳🇵🇳🇵🇳🇵🇳🇵
nice sessin
5:44 the advantages start ( if you are looking for them like me one night befor interview)
beauty with brain
Singly linked list has single link to its next node
🙂🙂👍
Mam for backward traversal do we need need to change the head pointer?
Traversal is different from reversal. So, no need to update head pointer
Mam please provide Handwritten notes of data structure and algorithms
Explain tower of hanio
👌👌👌👌👌....
Mem make video a bucket sort
Class mam
{
Psvm(String a[])
{
S.o.p("Thankyou");
}}
Mam wouldn't it be allies
Int takes 2 byte not 4 bytes
She's talking wrt 32 bit compiler
@@sahilprasantachoudhury911 thank you
💯
a view to just see the mam.......... :D
write a program for Doubly linked list with insertion.
Code:-
class Node:
def __init__(self, data):
self.data = data
self.next = None
self.prev = None
class DoublyLinkedList:
def __init__(self):
self.head = None
# Insert node at the front
def insert_front(self, data):
new_node = Node(data)
new_node.next = self.head
if self.head is not None:
self.head.prev = new_node
self.head = new_node
# Insert a node after a specific node
def insert_after(self, prev_node, data):
if prev_node is None:
print("Previous node cannot be null")
return
new_node = Node(data)
new_node.next = prev_node.next
prev_node.next = new_node
new_node.prev = prev_node
if new_node.next:
new_node.next.prev = new_node
# Insert a new node at the end of the list
def insert_end(self, data):
new_node = Node(data)
if self.head is None:
self.head = new_node
return
temp = self.head
while temp.next:
temp = temp.next
temp.next = new_node
new_node.prev = temp
# Print the doubly linked list
def display_list(self, node):
while node:
print(node.data, end="->")
node = node.next
# Initialize an empty doubly linked list
d_linked_list = DoublyLinkedList()
d_linked_list.insert_end(5)
d_linked_list.insert_front(1)
d_linked_list.insert_front(6)
d_linked_list.insert_end(9)
# Insert 11 after head
d_linked_list.insert_after(d_linked_list.head, 11)
# Insert 15 after the second node
d_linked_list.insert_after(d_linked_list.head.next, 15)
# Display the list
d_linked_list.display_list(d_linked_list.head)
print()
d_linked_list.display_list(d_linked_list.head)
😍😍😍😍😍😍mam
Mam apke handwritten notes kaise milenge
Hello ma'am, can you provide written notes of Data structure?
💞❤️
I hope it will be translated into Arabic
Learn English a 5ona.
21 feb