LinkedList Readme

Author: ji-sang-geun

C++/Data-Structures/LinkedList/readme.md

@@ -0,0 +1,60 @@
+### LinkedList
+- [Circular Linked List Operations](Circular%20Linked%20List%20Operations.cpp)
+
+ Circular Linked List Operation puts the linked list in the want position. 
+
+ Time complexity = O(n)
+
+- [Deleting a Node in Linked List](Deleting%20a%20node%20in%20linklist.cpp)
+
+ Deleting a node in linked list can delete the desired node. 
+ 
+ Time complexity = O(1)
+
+- [Deletion Circular LL](DeletionCircularLL.cpp)
+ 
+ DeletionCircularLL is a combination of functions 1 and 2. 
+ 
+ Time complexity = O(1)
+
+- [Doubly Linked List](DoublyLinkedList.cpp)
+
+ DoublyLinkedList is not a one-way connection, but a left-right linked list. 
+ 
+ Time complexity = Insert at beginning or end & Delete at beginning or end : O(1), Search : O(n), Access : O(n)
+
+- [Flatten List](Flatten_List.cpp)
+
+ Flatten_List is to make the list flat by removing the overlay. 
+ 
+ Time complexity = O(n)
+
+- [Insert A Node Linked List](InsertANodeLinkedList.cpp)
+
+ InsertANodeLinkedList is similar to the insert of the Circular Linked List, but there is a difference that it is not circular. 
+ 
+ Time complexity = O(n)
+
+- [Merge Sort in Linked List](MergeSort%20in%20Linked%20List.cpp) 
+
+ MergeSort in Linked List is linked list is a method of subdivision and merging using Merge sort to solve the disadvantage of large time complexity. 
+ 
+ Time complexity = O(nlog n)
+
+- [Ordered Linked List Strings](OrderedLinkedListStrings.cpp) 
+
+ OrderedLinkedListStrings is to sort linked lists by alphabetical order of String. 
+ 
+ Time complexity = O(n)
+
+- [Reverse A Linked List](ReverseALinkedList.cpp)
+
+ ReverseALinkedList uses LIFO, and if the way in which data is printed first is FIFO, the way in which the last data is printed first is called LIFO. 
+ 
+ Time complexity = O(n)
+
+- [Single Linked List](Single_Linked_List.cpp)
+
+ Single_Linked_List is a one-way, one-way list with the simplest structure of the Linked List. 
+ 
+ Time complexity = Θ(n)