HOME
Linked list:
In order to store elements in the sequential
fashion we use Arrays. But they are fixed max
size,suppose if we want to use less memory than
that of fixed size then memory is wastaged, or
If we want to use more memory than that of fixed
size then deficiency of the memory will be the
problem.
In order to overcome all these type of problem
we use dynamically allocated memory ,which can
be allocated at run time called as node, so the
sequential arrangement of nodes are called linked
lists.
There are 2 types Single linkedlist and Double
linkedlist

HOME
Linked list:
In order to store elements in the sequential
fashion we use Arrays. But they are fixed max
size,suppose if we want to use less memory than
that of fixed size then memory is wastaged, or
If we want to use more memory than that of fixed
size then deficiency of the memory will be the
problem.
In order to overcome all these type of problem
we use dynamically allocated memory ,which can
be allocated at run time called as node, so the
sequential arrangement of nodes are called linked
lists.
There are 2 types Single linkedlist and Double
linkedlist

how reverse traversal is possible in single linkedlist?
will u plz send code for ds programs