Linked list is a simple linear data structure formed by collection of data elements called nodes. Each node consists of a data element and link field.
There is a head node that points to the starting of the linked list.
this diagram shows a simple representation of the linked list.
Also if you want to contribute to the below program or download the source code please go to the following Github link : Linked-List-in-C++
You might also be interested in
There is a head node that points to the starting of the linked list.
this diagram shows a simple representation of the linked list.
Linked list can be used to implement stacks, queues, list, associative arrays, etc.
Unlike arrays linked lists are not stored in contagious memory locations rather the are stored at any empty place in memory and the address of the next node is stored in the link field.
Also you don't need to declare the size of the linked list at the time of initialization you can dynamically keep adding elements to the linked list.
Click for complete information on Linked List
The following implementation of the linked list has the following methods implemented :
1. isEmpty() : method returns true if the list is empty
2. getHead() : returns head node
3. addToStart(): method to add a node at starting
4. addToEnd() : method to add a node at the end
5. display() : method to display all the elements of the Linked List
6. length() : method that returns the length of the Linked List
7. insert() : method to insert element at a given position in the Linked List
8. deletePosition() : method to delete a element at a given position
9. deleteData() : method to delete a data element
10. findMin() : method that returns the max element
11. findMax() : method that returns the min element
12. countOccurences() : method that returns the occurences of an element
13. pop() : pop method removes last element of the Linked List
14. tostring() : method that returns a string of all elements of the String
15. copy() : method that returns the copy of the list
16. clear() : method that clears the Linked List
17. reverse() : method that returns reversed linked list
18. recursiveReverse() : method that recursively reverses the Linked List
19. indexOf() : method that returns index of a particular element
20. atIndex() : method that returns element at a particular position
C++ Program
You might also be interested in
- Linked List in Python
- Linked List in Java
- Github - Linked List in Python
- Github - Linked List in C++
- GitHub - Linked List in Java
Comments
Post a Comment