Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

added list README #3960

Merged
merged 4 commits into from
Mar 5, 2019
Merged

added list README #3960

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
661ee0d
added list README
Bhupesh-V Mar 1, 2019
887ba6d
minor fixes
Bhupesh-V Mar 1, 2019
76c0017
used h2 level heading
Bhupesh-V Mar 2, 2019
98e9aad
removed HRs
Bhupesh-V Mar 5, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 24 additions & 0 deletions code/data_structures/src/linked_list/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
# Linked Lists

## Description

A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers.
In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) or pointer to the next node in the list.

## Functions

- insert()
--Inserts a new element into list.
- delete()
--Deletes an element into list.
- search()
--searches for a particular element in the list.

## Time Complexity

- Insertion : O(1)
- Deletion : O(1)
- Access : O(n)
- Search : O(n)

![visualization](https://www.tutorialspoint.com/data_structures_algorithms/images/linked_list.jpg)