Update Singly Linked List.md

varunu28 · web-flow · commit b962c96d918d · 2017-10-06T15:51:12.000-07:00
diff --git a/Data Structures/Linked Lists/Singly Linked List.md b/Data Structures/Linked Lists/Singly Linked List.md
@@ -8,7 +8,7 @@ A linear & connected data structure
 
 - Size of a linked list is not fixed 
 - Deleting and adding an element in the middle is not expensive compared to an array
-- Elements can be accessed sequentially not dynamically
+- Elements can be accessed sequentially not dynamically compared to an array
 - Extra memory allocation needs to be done for pointers which connects elements in a linked list
 
 
@@ -27,7 +27,8 @@ class LinkedList
     }
 }
 
-Here every node has a value and a pointer to the next node. The head node signifies the first element in the list
+Here every node has a value and a pointer to the next node. The head node signifies the first element in 
+the list
  ```
 
 #### Code Implementation Links

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@ A linear & connected data structure`
`8`	`8`
`9`	`9`	`- Size of a linked list is not fixed`
`10`	`10`	`- Deleting and adding an element in the middle is not expensive compared to an array`
`11`		`-- Elements can be accessed sequentially not dynamically`
	`11`	`+- Elements can be accessed sequentially not dynamically compared to an array`
`12`	`12`	`- Extra memory allocation needs to be done for pointers which connects elements in a linked list`
`13`	`13`
`14`	`14`
`@@ -27,7 +27,8 @@ class LinkedList`
`27`	`27`	`}`
`28`	`28`	`}`
`29`	`29`
`30`		`-Here every node has a value and a pointer to the next node. The head node signifies the first element in the list`
	`30`	`+Here every node has a value and a pointer to the next node. The head node signifies the first element in`
	`31`	`+the list`
`31`	`32`	```
`32`	`33`
`33`	`34`	`#### Code Implementation Links`