Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

Linked List Implementation in C/C++ | Creation and Display | DSA Tutorials
Jenny's Lectures CS IT
video is for this topic is you should know the basics of link list what is link
list how to represent a link list or a singly linked list
...
Plus you should have the knowledge of pointers plus structure
what is structure data type in c
...
In C language we are going to
write struct node if you do n't write def fine in C++ you can simply write
this node that is fine but here I am discussing C language fine now we have
created this head node initially suppose we n't have any node in the list so
initially what head pointer will store head is going to contain word 0 or you
can say null
...
In C++ you can
use new keyword fine to use malloc function in C++
...

The data type is int so we are going to use percentage D and now C you can
not directly write here hash in this address of and data
...
Head is
equal to new node so simply you can write head is
...
new node
...
going to contain
zero now next thing is you have to point this to this right so now you have
...
You simply write head is equal to new
new node then in this case also now head is going to contain head is equals
to new node
...

We are going to store new node the new node is going to contain 300 so
here we can insert now
...
temp temp is
equal to new node that is 200 fine when we were creating when we 're

inserting this second node fine press plus what you will write here temp is
...
If user press 0 it means where you are not going to create another
node now we are going to print these values fine so for that what you will
write after this what you'll write you will ask from the user do you want to
continue for taking input you are using scanf address sorry percentage D
address off
...
till / take



---