Linked List & its types
- Singly, Doubly, Circular etc.
Linked list is a type of linear data structure which is formed by
collection of nodes We will talk in layman terms , so that you
can get clarity. Coding Ninjas has supported us in this course
by supporting the major chunk of the video sponsorship. The
best thing about CN is that you get one on one doubt support
All your doubts will be resolved within 1-2 hours. The courses
are available in both Hindi and English languages You will also
get hint videos in every question. If you want to buy any of
their courses Then you can use the link in the description to
get the 20 % off on all of their courses. Use the link to get a
20% discount on any of the courses. There is no need of
continuous memory allocation and your data will be stored in
this way This is an efficient data structure , you can change its
size at run time We call this singly linked list. There is Doubly
LL Circular, Circular and doubly LL These are some types of LL.
In this way you learn how you can use constructor in the Linked
list. There are two things inside node,
1. data
2. address.
3. In address we are talking about the pointer. This pointer is
pointing to the node. This type of Linked List is called Singly
Linked Lists. Bhaiya explains how we will learn how to
traverse a linked list. He says we will use a print function
which will print our Linked list. We will use endl for better
visibility. We used endl to show how the list traverses and
how we can do it in a few minutes. The way I am using head
is using head , insert at head. The way you kept head ,
same way you have to keep tail. In starting I also created
tail , Node * tail=node1 When there will be single node ,
then you will call same node as head and tail void inset At
Tail.
Hindi language is like English only , simple thing. You have to
just to convert Hindi language into code. For this, make a node
Node * node To Insert =new Node (d ) Node To Insert - > next
=node To Insert. Insert 22 between 12 and 15 insert Position
- Singly, Doubly, Circular etc.
Linked list is a type of linear data structure which is formed by
collection of nodes We will talk in layman terms , so that you
can get clarity. Coding Ninjas has supported us in this course
by supporting the major chunk of the video sponsorship. The
best thing about CN is that you get one on one doubt support
All your doubts will be resolved within 1-2 hours. The courses
are available in both Hindi and English languages You will also
get hint videos in every question. If you want to buy any of
their courses Then you can use the link in the description to
get the 20 % off on all of their courses. Use the link to get a
20% discount on any of the courses. There is no need of
continuous memory allocation and your data will be stored in
this way This is an efficient data structure , you can change its
size at run time We call this singly linked list. There is Doubly
LL Circular, Circular and doubly LL These are some types of LL.
In this way you learn how you can use constructor in the Linked
list. There are two things inside node,
1. data
2. address.
3. In address we are talking about the pointer. This pointer is
pointing to the node. This type of Linked List is called Singly
Linked Lists. Bhaiya explains how we will learn how to
traverse a linked list. He says we will use a print function
which will print our Linked list. We will use endl for better
visibility. We used endl to show how the list traverses and
how we can do it in a few minutes. The way I am using head
is using head , insert at head. The way you kept head ,
same way you have to keep tail. In starting I also created
tail , Node * tail=node1 When there will be single node ,
then you will call same node as head and tail void inset At
Tail.
Hindi language is like English only , simple thing. You have to
just to convert Hindi language into code. For this, make a node
Node * node To Insert =new Node (d ) Node To Insert - > next
=node To Insert. Insert 22 between 12 and 15 insert Position
