A linked list is a linear data structure it is a collection of data elements
● which are stored in known consecutive locations
● . Accessing of any elements will take order of 1 only constant time fine here insertion
is easy and deletion is also easy why so because see if sorted air is there like this
see.
● take order of n time complexity and in array it is order of 1 only next point you can
say binary search is not possible in linked list.
● In next video I am going to discuss the basic operations of this linked list traversal
insertion deletion something like this with the help of their code.
● which are stored in known consecutive locations
● . Accessing of any elements will take order of 1 only constant time fine here insertion
is easy and deletion is also easy why so because see if sorted air is there like this
see.
● take order of n time complexity and in array it is order of 1 only next point you can
say binary search is not possible in linked list.
● In next video I am going to discuss the basic operations of this linked list traversal
insertion deletion something like this with the help of their code.
