Skip to content

Commit

Permalink
Merge pull request kdn251#6 from jsroyal/master
Browse files Browse the repository at this point in the history
added circular linklist
  • Loading branch information
kdn251 authored Mar 14, 2017
2 parents 80d0a37 + 2fef1c2 commit c22ad56
Show file tree
Hide file tree
Showing 4 changed files with 3 additions and 2 deletions.
Binary file added Images/Complete.png
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file added Images/Full.png
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file added Images/Perfect.png
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
5 changes: 3 additions & 2 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -33,8 +33,9 @@
* A *Linked List* is a linear collection of data elements, called nodes, each
pointing to the next node by means of a pointer. It is a data structure
consisting of a group of nodes which together represent a sequence.
* **Singly-linked list**: linked list in which nodes have pointers to the next node
* **Doubly-linked list**: linked list in which nodes have pointers to *both* the previous node and the next node
* **Singly-linked list**: linked list in which each node points to the next node and the last node points to null
* **Doubly-linked list**: linked list in which each node has two pointers p, n such that p points to the previous node and n points to the next node; the last node's n pointer points to null
* **Circular-linked list**: linked list in which each node points to the next node and the last node points back to the first node
* Time Complexity:
* Access: `O(n)`
* Search: `O(n)`
Expand Down

0 comments on commit c22ad56

Please sign in to comment.