in last video sir said that the memory is required O(E) in adjacency list but here i think that space is of O(V) bcoz we r making array of size v
Adjacency list doubt
hello @deepakjumani09
the space complexity in case of adjacency list will be O(E+V) .
becuase In an adjacency list for every vertex there is a linked list which have the values of the edges(other vertex) of to which it is connected.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.