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

---

DATA STRUCTURES
Anyone asks you this question, that why heap is used, it can also be done from stack
...
I just come back with the value you just wait here
...


this video we will focus on linked list & binary search tree so if you want to know more about
these then you should go ahead and watch the video and learn more about these things
...
If you don't
know C properly, then I have made a 15-hour long video of C with notes
...
It happened like this , I was bored in my house
...
This guy has amazing games like Pubg and GTA5
...
He likes playing games a lot
...
But there is one problem , I also use jio
...

And with more internet , we ca n't sell files and all
...
So what will I do ? I will take my bike As the size of this input will get
increased, the runtime of the algorithms will increase
...
There is a hard
disk then there is your motorcycle
...
And you will take it and in hard disk
whether you bring 250kb or Tb
...
Runtime remained the same
...

We are to trying to remove the time complexity of them
...
We are doing a real-world analysis of
things
...
Because it was constant we remove n to
power 0 and make it 1
...
If I do T algo1 then what will happen
here ? What do I have to do ? When I am sending data then I must upload and send
...
Now, considering I turn on my computer In that , I will need time L1
After that what happened ? Consider all preparation I required L1 which will be a constant 5
secs,2 secs , 10 secs
...
L1+ consider your speed is L2
...
Writing equal to is wrong here
...
Because n to
power 1 , if I increase input and make it 10 lakh
...
So the higher degree term in the polynomial In any equation The most impactful term It is
taken ok
...
And I want to

see things in a simple way
...
Big O is a log that scales according to the time required to run your algorithm
...
If it runs in linear time Big O
...
O in the industry means the order of And its mathematical
definition that I will tell you
...
But when you are
answering in industry Then industry definition is used
...
Then I will
say an order of because big O has a different definition
...
The
graph of Big O of 1 is plotted like this
...
Do n't confuse it with the
x=1 graph
...
Constant , whatever constant was there in constant time it
was running
...


Time complexity is the study of the efficiency of algorithms
...
Time will increase and time will increase or decrease
...
They
were very simple
...
And over there Rohan's algorithm was
around 120-130ms
...
After that when I gave 1000 elements for their algorithms ,
Then shubham's algorithm got busted over there
...
Both
are better in their places
...
take the highest order term
...
And Big O n square square is here
...
In the next video we will solve problems & see other concepts
...
we talked about order
...

We have primarily 3 types of asymptic notation big O, big Theta (Θ ) and big Omega (Ω) big O is
represented by capital (O), which is in our English
...

Mathematically, mathematically this function can be anything
...
G ( n) is your function which will come inside the big O
...
If you guys can find any such
constant ( C ) and ( n ) -node , then f ( n) is O ( g ( n)" This is the mathematical definition of big O
...
This question is its own truth , it has validity , it will
remain valid
...
And along with that, I 've packed one more thing into this video :
The definition of Log
...
1
...
7
...
If you know even a bit of maths, You 'll know that it is in an ascending order
...
Suppose the value of A is 8
...
Meaning 1
...


...
If the value is 9, What will the answer be ?
Your answer will Algo 1 is a simple person
...
It is comparing it
with all the numbers
...
Because Algo
...
It will tell us in the first comparison itself
...


If Algo 1 is in luck, The time needed is ' k ' - T=k
...
Take
a 10-element array, take a single element array or take a 10,000 element array
...
Now, AlGo
1 's luck is bad
...
Average Case
complexity is equal to
...
The O
( Sum of all possible run times divided by the number of possibility ) is O ( n ) The average case
complexity is the sum
...
to
...
possible run
...

by the total
...
So for an array size of 5, We saw six cases
...
n+1 If 'n ' is the size of the array , Then there is 'n+1 '' number of possibilities
...
If the element is here, How many comparisons will it have to make ? It will
have to do
...
2
...
I 've taken ' k ' as common out of everything
...
And this I have added separately
...
AP is used in 'O ' a lot
...
When there are questions on 'O' APs and GPs are used in the
answers to questions on O
...
The Average Case Time is not generally asked for a
unique algorithm
...
So what is the Average Case
...
Algo 1 was making 'n '
comparisons
...
Algo 2 is a cunning person
...
It made one comparison For a size of
10 array , As well as for an array of size 100
...


The midpoint between 1 and 100 will be 50
...
If there are an even number of elements here, there are 2-2-4,2-6
elements
...
So I can take either of them as midpoint
...
You can
halve 8 once, and it will become 4
...
How many times can you divide 16 ? You

can divide 16 once, twice, twice and four times
...
So I told you a very good definition of 'Log '
...
This definition that I have
told you in this course , You would n't have got it very easily
...
You must
appreciate the definition of Log
...
The stack will have a value of factorial 3 at a
particular time point
...
OKay? And that is how the space complexity works for a function when it
calls itself recursively
...
I can only say
that the algorithm will take time y on a computer with processor X
...
In this particular case,,
my algorithm is running in 2 seconds on my computer with an i9 processor
...
It might run in
10 seconds on a computer with an i7 processor
...
The passage
...
The passage discusses the space complexity of
the factorial function
...
THe space complexity is measured in stack frames, and it is observed that
no matter how large an input's factorial, there will be a corresponding number of activation
records
...
This passage provides insights into the algorithm's computation
complexity
...
This is why the algorithm measures growth in terms of asymptotic analysis
...
After that we will do some set of questions
...
due to the time complexity of any algorithm when you have to find it so what
is the first step that you do and at the same time how to approach this problem
...
We believe that these
operations are all (k ) time consuming This for loop , that is , how much time is being taken for
this fragment It seems ( kn ) , okay So before this ( int i ) would have been written here, ( int k=0 )
would be written here
...
The first fragment turned out to be this one , with a little bit of initialization
...


I will go for ( n = 100 ) to determine whether i will be going for n = 1000
...
There
will be some code on it which will take ( k1 ) Now I have become so smart, by doing questions ,

and you will be done too That (k1) it is will going to be non-dominant , if constant is being added
then we will remove it
...
Then ( j=1) will become Then ( 0,2) Then (i=0 , and j=0 ) will then run for Okay
...
When ( n) is running out, watch carefully , watch very closely
...
value of i will be ( 1) , ( n ), it
will be n-1 because I am taking the index ( i=0 ) then (i=n-1) will be and here is ( n- 1 )

I told you guys If it 's not clear to you why it will work ( n² ) times So I 'd say let 's go look at it for
3 and 3 and print here (i , j ) and make a count variable and count it , how many times it is
running You write ( c ) program , write in Python, write in Java, write in Python and write in the
Java
...
And if another loop
is given inside it , then it will run ( n³ ) times
...
And I
have also given their programs to you
...
So it 's saying that Find the time complexity ( Func1 ) function in the program shown in
program1
...
Even if you come from another programming language nothing is going
to be change
...
The time is not depending on Array 's length so i 'll accept it ( k1 ) and I can not accept
( F2 ) as ( k ) , i will accept it as k2 * n
...


The answer is O (length) The algorithm it is talking in terms of length over here
...
c as follows
...
If you look carefully above it is written ( n ) times,
if you write 1 for ( n times as ( 1+1+1 +1 + n) So what will happen if I write (n²) so it is done O
( n²) So anytime you see the double for loop , and it 's going to [ 0, n ] , [ 0 , n ] and [ 0 n ] i
...
for 0
, ( n) times it will run OK , so this will run 0 for (n) times, then 1 for n times then it will again 2 for
n
...
And there is some constant work going on inside it so it means The average
processing time is T ( n ) so T ( 6 ) is a small number
...
only
...

So I have a friend that wanted to build a PC So he approached me and asked '' Harry , can you
give me a blueprint to build PC ? '' '' So that with that blueprint I can make someone build PC? '' ''
I want to do gaming and streaming
...
I told him all the main
components of a PC
...
We will study array
ADT
...
Arrays as an abstract data type
...
Not MRF tyres, nor the bat one ; I 'll give you minimal
...

And some operations , that you can define later on your own
...
Arrays can be found in a lot of programming languages
...
In Python, they are called 'lists' and in Java, they're called lists
...
For example, Get is done , Set is done
...


An array is a collection of elements
...
The memory layout of the C
programme is a code section
...
Inside a
function is a stack
...
The kernel is the kernel of the kernels
...
But, you can search on the internet There 's a
paper by jee-stars
...
How
calculations will become easy
...
When you requested a memory till 38, then it is possible that some other
application was given some memory by the compiler
...

Otherwise in the same programme It must have allocated a variable in correspondence with that
memory
...

You can increase it in the linked list, we 'll talk about that ahead
...


An array can not be resized
...
It wo n't get this block
; no
...
resized this way
...
Get and Set is very
easy in the C language
...
But we 'll
implement this array ADT with the help of structure structure
...
We
'll build it however we want to
...
In my ADT I will provide the
user with the ability to use my Add method
...
That why we use arrays
...
Where does the scam happen
in the array ? At the time of deletion and insertion
...
Because I 'll have to move it
...
And you 'll get that by practising
...


In an abstract data type, abstraction means hiding the implementation details
...
Array ADT holds a
collection of elements It can float , it can be int
...
And it can also be
structure in C language
...
Because only
one calculation has to be done And it will take constant time
...
We 'll

do this in a while ; I 've told you about memory representation sufficiently
...
But if you want to stick to data structures keep following this
course And you will definitely like it and it will benefit you a lot
...
We can directly link it with object-ended programming
...
And here, by the name of 'Algorithms
...
Like an integer, I can also make my own data type , Assume that I
want to make a data type called 'my array' The C language is a special type of array
...
total_size
...
Base
address is the pointer
...
I 'll do it like this
...
of operations
...
What can those operations be ? Those operations can be anything
...
So we can define a lot of these types of operations
And we can make our custom data types
...


This is Stack And this is Heap
...
If I
want to make an array, I can either I make the array in the stack Like if this is the stack of the
main function , okay
...
I 'll write Main here
...
I request some memory , And make its previous address point , And here
with my array , I can request Its indices will be 0,1,2,3,4
...
It 's my choice ; whatever I choose to put
...
If we have to make an array of size 'n ' , So n multiplied by ; meaning star Then the
size of operator , and after that, int
...
Figure out once
you see it When I give you the notebook
...
Operations
...
e the capacity to store 6 elements
...
The
advantage I 'll get is If I ever want to make insertions in this array Then I can move them a little ,
all the elements
...
And I think moving things a bit is better
...
The capacity of arrays is
...
So in
arrays , the biggest advantage is this : It is the fact that you can access the element ; You can
calculate from the base address
...
a milestone 3
...
5
...
This is our Delhi and assume there 's a route from here And from here, how many

kilometres away from here
...
So I 'll quickly tell a little bit of implementation in this video We 're going to code
anyway
...
And I do n't want to
do it on the whiteboard
...
I just want you guys to like , and keep up the enthusiasm
...
I 've made these notes for
you All the details are there in here
...

This is the C in 1 Video That is of 15 hours
...
And you should download and install this
...
The biggest advantage of this is that today I 'm writing C language Code in Visual
Studio
...
In Visual
Studio, I 've made a snippet of boilerplate code for Array ADT
...
If you do n't know where to get this code or If you don't know how to
use it, Then you can refer to this video
...
For example, if Google is taking up too Chrome much RAM You 'd
wish for it to take up less RAM
...


A custom My Array abstract ADT uses a pointer that points toward the total size, the used size
and the first element
...
My array can
not go beyond this Because the compiler has reserved the remaining memory for someone else
...
This is how I felt it should be implemented
...

There can be another implementation as well
...
And once I get the structure instance , Then I can add a dot and access its total size or
anything
...
= t size I 'll want that this t-size is passed And along with that , I 'd want that
used size should also be passed
...
We 've even set that we have to use 20 blocks only
...
But for now, we must use only 20
blocks
...


We put a star when we want the value of the address and call the ampersand the address of the
operator
...
And if you
want to use 20 and want to make it 100
...
e this is where you 've given the structure address , It will dereference that with a
star
...
It replied , okay
...
So for that I 'll have to call for the
createArray function
...

And it will update its pointer in this itself
...
It 's
in my Python course but it 's very useful
...
And here I
will write scanf % d & n & n
...


myArray is an abstract data type in which I have defined a total size integer , a used size integer
integer, and a pointer called ptr
...
The pointer of the pointer of ptr would be pointing at the first element
...
I have made a function called createArray
...
After that, it is also taking how much total size you want and how much
you will use
...
That 's why I 've reserved
10
...
In that , I can use all my methods
...

Today we 'll talk about some operations in array
...
It
's the easiest thing in array, it 's like 2x2=4
...
If you want to print all the array elements or you may want to set this array
...
or similar doubts, then your situation is such that you need to write C
language
...
At about
11 at night, you 'll be done with it
...
I've
included practice in it
...
I'll tell you what I was going to say
...
So, you can make two variables, one will be
capacity
...
You can make size , it will be 5
...
Capacity shows that this is the potential
...
That's why you take
a higher capacity in array and the size is 5
...
The children are standing here and suppose
something is being given out like ice cream
...
Though in school you join the line first and shift later
...
This goes up to 99, 0, 1, 2, 3, 4
...
Now, if you 're a very lucky person , then you 'll get index number 5 for insertion
...
I have provided everything , just download the notes
...
I zip it so that all codes, source codes,
and pdfs are in one place
...
It 'll be O ( 1) in best case, you had to delete the last one
...
In both best case and worst case cases, the size does n' matter
...
There 's no other option , only prayers will work
...
You do
n't want an overflow condition , it 's called overflow
...
You
can search in this way, one by one
...
This is
called linear search
...
You 'll take its greatest integer and mid will be 2
...
You'll check if it 's greater or smaller than mid , it ''s smaller
...
After this
convergence, your search will be over
...
Otherwise,
binary search is the way to go
...
In the coming videos, we 'll code these operations in C language and C++ too
...
Python, Java etc
...
Majority of the people
wanted data structure algorithm in those languages
...
We 'll
understand whatever we did in theory and I hope you like this course
...
If you remember , we had talked in great detail About what ?
We 'd talked about some array operations in detail
...
This is a course for data structures I do
n't want to teach you how to print the elements of an array
...
And that it has the capacity to store 100 elements
...
If there is no space in your array, then what can
you do? If your whole array is full; when your size is > or = to the capacity , Then I ca n't take any
more in it
...


When there 's no space or capacity you 'll have to return -1
...
And ahead of this , there is a lot of space
...

So I 'm taking -1 as a representation because if you return
...
Okay ? Now I 'll do this
...
n't
...
Now if it does n't get
returned , what does it mean ? So I want that index 4 should go ahead
...
If there was n't space then it would return it
...
I 'm starting from
i=size -1
...
'll have to do arr (i+1 ) =arr (i )
...
1 for success
...
I hope that this course must be helpful for you
...
And many of you have downloaded the
notes
...
If the insertion is successful, You will print the new , modified array
...


You have both the notes and the video ; I 'm also making you do the practice questions I have
also uploaded the OneNote notebook
...
So I hope you 're finding this course very helpful and I will see you next
time !
In this course on Data Structures and Algorithms , we have seen a lot so far
...
What is Linear Search ? And what is
binary search ? What is linear search? And what's binary search? We're going to code it here
because it is asked a lot
...
I will give you a real life example of binary search that when you will do binary
search
...
Or if you reach the end of an array, then you have to say that the
...
over
...
that's all
...
should be opened inside a thousand pages in a book
...
If pages were stitched at
random, then you would not be able to do this
...


Binary search works just like I took the example of the book
...
Sorted array
Array must be sorted , okay
...
You can add any
number of elements to a sorted array
...

One will keep the track of high , will keep track of mid
...
I calculate the mid (8+4 ) /2= 6 My mid turns 6 , so this will be my mid ,
so it will be the mid
...
When I upload
the video , it takes me some time to put the notes on the website
...


I did not talk about this , here it is a little important to tell it So look at this , which is our Linear

Search and Binary Search : What do we people have to do , if you are looking at linear search ,
then its complexity is O ( n ) But if you look here binary search So I 'm halving the array until it
runs out , does not converge speak the same ( log n ) So here you people will not face any issue ,
okay So this thing must have been cleared to you guys , I hope
...

Do return 1 means I have got this element here in the array or I will do one thing that I will return
only the index of the array where I have
...
As soon as the element is found, while traversing this array
Then you return the index where that element was found
...
As this return i ; is written , the
function terminates and returns The function 's activation record in this stack gets lost
...
If you will do (5 + 6 ) /2 , Then it would be
11/2 After that it will give you 5 automatically
...
So you do n't care about the greatest integer Directly ,
even if you write like this , It will automatically take that greatest integer
...
So I 'm not going to search inclusive from
here I will search from 100 to 400 in consideration , and repeat the same thing with him
...
If low and high are converged it means the element which is not available to me
...
If return-1 needs to be executed it just means that the return
did n't happen inside this while loop it has not returned inside the while loop
...
So let 's run this
man for an array
...
The
name of linked list is the name of a linked list , if you 're listening for the very first time and it is
possible that you 've read it before and did n't understand that i will start with and example to
explain this thing and the example will be of a hospital
...
The advantage we got here is that we could n't
get all the beds at the same place
...
In linked list it has a
node which has a space for data one is for pointer to next and another one for pointer
...
To extend this list is very easy
to extend this is not easy and sometimes impossible too
...
Inserting and deletion in linked list is so

easy as much as is to interconnect two links
...
for no use array has its own benefit and this
is advantageous there this one is not and where this is not advantageous there is not
...
The address is 280 so in this 280 is there and is pointing that point does n't mean that it is
done by a finger it means in this the address is kept stored i will do and show you by coding it
...


In linked list the memory and capacity are the same in linked list you can join the nodes and
remove nodes from the mid does n't matter in array
...
In linked lists elements are there in non contiguous memory location if
it is 0 then it can be 2000 or 4000 and then the next node can be again 40 anywhere
...

i would request again please do share this playlist not just for saying please do it only two
people shared this playlist and i 've tagged both of them and if you share this i will tag to you
people too tag and share this
...
We
had seen what is needed : linked list , why we need linked list, what will be the benefit of doing
linked list
...
Pointing means
that it is a variable and this is its address
...
If a pointer stores the address of another struct Node here , I would say it is pointing to
this struct Node
...
I was getting a lot of comments
in such a way that I repeat things sometimes so I will not repeat here now , I will point you here
at the place where you people will find the arrow operator
...
To see if you want head data then you can simply use
arrow operator like this

So let 's go to the VS code , and in C language , to see the creation and traversal of linked list
...
And then you 'll
have another node over here , and the pointer to this one will be linked to that node
...
So traversal 's time complexity is O ( n ) because if n nodes are in the list
then (n ) times you are travelling the list
...
c template was created
...
So if I talk about the video number , then by opening the playlist ,
the song will be the number 14
...
I

will define my structure here
...
How will it be possible ? It should be
possible that first my pointer will point to the head node then after that I will find the element
next to the
...
So what will it take , this is just what I want ( struct Node * ptr ) i need
pointer I want a pointer that is of type Node * And it 's pointing , where at the head
...
I will
print the data and find that next node and run that data
...
I did n't even call this function
...
And you
guys see , Element 7, Element 11, Element 66 and Element 66
...
e
...
And I have n't made the fourth ,
so I have to make the fourth
...
fourth
...
So I
would just like to say that you guys here of four element , five element, five element , 10 element
here are able to make linked list of it
...


Only 1 or 2 people are coming forward to share the course in Data Structures
...
Do n't forget to tag me Below I
have given the link of my Instagram in the pin comment comment
...
It is Insert
after and we will also talk about their complexity
...
Head node is pointing to the first element of my
linked list
...
I have to fit it in the starting
...
There are 5 lakh elements, so how much time is it taking , is it increasing , if
it is increasing , then because of what fear is increasing, that is time complexity
...
It is not depending on
( n ) at all And but when it does n't depend on (n), we had already seen in the lesson
...
If I want to have an insert here, here is an insert , then I am
calling it index 1
...
After that, point it to the next : from here
...
So this is very

good news for you You will always work in constant time But good things do n't always happen
We are not always so lucky in life So we 're here therefore , looking for worst case
...
be inserted
...
and i will be able to insert element at end of my linked list
...
I will show you
everything by doing , do n't worry at all you I 'll talk about now Insert After a Node
...
Equate the next to ( q ) to the letter so this linkage comes out like this
...
These four cases are very
important : for insertion in linked list
...
Whether
the insertion we have, is becoming successful or not
...
video because it is
going to be very important
...

ave told you the four types of insertion in the last video
...
Get the link from description or can go
directly on codewithharry
...
I am creating a strategy here and will show you how our
strategy looks if we wants to insert in the beginning of the linked list so what thing should I have
? one thing I need is head and other one is data that what you want to insert
...
I am showing you in
the video what I did I wrote here PTR next is equal to head
...
Many people are beginners and weak in C
...
So , what will I do here forward the video on that part
where i explain you on this case two coming on insert in between how this will happen
...


No chain will break but this chain connect to this PTR next is equal to PTR
...
This is the simplest the work done so easily but what is head ? This is
head , the function is absolute right i hope it works let 's see it works
...
insert at end is so easy, what to do in insert
at the end ? I copied old function because lot of thing remains similar I am changing it
...

7,11,41,66 and 56 comes at end why at end ? beacuse I run insert at end which is code by me
see I have only written code here nothing much is done and code will run absolutely if you say
something to computer then computer is very faithful which I like about computer do whatever
you tell it
...
In all the cases you have to do this
only that join links like I tell you in all the 4 cases which I break and join understand linked list
like chain that will do insertion in between deletion also have same trick that we will see after
...
so atleast watch this last video first
because I have explain this in the video
...

If you have not accessed my playlist of data structure algorithm , do it now very few people
have access this , I do n't know why ? but I like to appreciate that many of you shared this on
Instagram with tagging me
...
what will happen to that ? where it 's memory go ? so this
thing is such that which can be asked to you in interviews
...
so If I want to delete index number 2 means index is given in between and I
have to delete it
...


There is p pointing now what you do ? keep moving this how much time ? what you will do ? you
run a while loop run a
...
What you do in while loop in P is equal to P 's next and till
when ? Till you reach index minus 1 way element that means if your index value is two then how
many time you have to run this ? you have
...
index value
...
I ask for the pointer Q which is
pointing that node which I want to delete once I reach till that point then what I 'll do ? I tell that
make P 's next to Q 's
...
next was pointing there P
...
I hope that this will also be straight forward I do n't want to
make video lengthy unnecessarily for you I will do this same
...
I want to give you some work case 1, case 2, case 3,
case 4 prepare code for all this and if possible create the code
...
video and will see your thoughts and which I am teaching
...
I want to
tell you this thing all things are same , this all are one concept do n't understand all this in three
different ways
...
If anybody is
saying about linked list and he showed you insertion
...
He said

that we can do insertion here we
...
do search , can do
...
n't get next null starting from the head we do head
's next , that's next
...
I have not tell you
practical use of linked list but I gave you example that how this things can be useful so here this
is circular linked list
...
in loop If I put
while loop here and till where I will move ? I move till P 's data does not equal to head , P ''s next
is not equal
...
head
...
P's data where ever is P put one print
here print that too which is missed P
...
and what happens with do while loop is , what you
do you should print one time
...
If P is not equal
to head then this data will print here I hope this is understood , I only want to say this
...

If you want to tell this linked list empty then you point its pointer to itself so this is one circular
empty linked list will be created
...
I want you guys
to tell me in the comment that should I add this type of programs , you want that I make more
15 or 20 videos on linked list how to insert in linked list
...
I have already created
the notes all I have to do is take snap and create PDF and upload it
...
things I hope you
understand
...
What i will do here is i ’ ll shift here to VS code and
here i will create a file and name it same as my video number 20
...
Okay i copied all
my main function and i paste it here and now see here what i have done i created head node 2nd
, 3rd and 4th
...
, ptr = ptr - > next ; and repeat this steps

untill your
...
ptr forward till the ptr 's next is n't equal to the head but if i write
a while loop here it will be clear
...


Do while loop is created for this purpose only what i will do here is i will move this while below
...
The case which i 'm teaching you in my opinion is the
most difficult one and rest all is straight forward
...
i 'm saying that the
data of ptr
...


i will make p 's next equal to the ptr so what will happen ? so this link will break and will come
here so i will use a pen and cross this link
...
I do n't know about it
i will see it now so first of all , i'll make it with black with black
...
So see i printed here before insertion and printed after insertion too so what
will i do here , i had created my insertion program here i had written a printf there which i am
going to copy
...
The playlist includes some of the most popular songs in the world
...
The video has been uploaded to instagram
...

We have a pointer pointing to the first node
...
In that too
there are operations like insertion , deletion , search too
...
There are many uses of doubly linked
list here and one of the uses of it you guys can reverse it easily by swapping the pointers
...
There are other uses too I will also make you guys get the practice sets of linked
list etc
...
A lot of people have access but still the number of people who picked up the
course : not everyone has access from here I want all to access , to bookmark
...
bookmark this playlist by
clicking here Click here to save

I prefer to use singly linked list if I feel like it will be more feasible
...
You come in a doubly linked linked
list when you may have to go back and forth in both directions
...
I want to give a
challenge to you guys here
...
Then you see people getting the reverse linked list
printed
...
We will wrap the
topic of linked list and come later we will return to linked list And after that we will see the
people who : this , but you have to code the doubly linked list
...




---