Update src/data/roadmaps/datastructures-and-algorithms/content/103-basic-data-structures/101-linked-lists.md

Co-authored-by: dsh <daniel.s.holdsworth@gmail.com>
6 months ago · 1bca8e4bfa
parent f83ba31af5
commit 1bca8e4bfa
1 changed files with 0 additions and 1 deletions
--- a/src/data/roadmaps/datastructures-and-algorithms/content/103-basic-data-structures/101-linked-lists.md
+++ b/src/data/roadmaps/datastructures-and-algorithms/content/103-basic-data-structures/101-linked-lists.md
@ -2,7 +2,6 @@

 Linked Lists are a type of data structure used for storing collections of data. The data is stored in nodes, each of which contains a data field and a reference (link) to the next node in the sequence. Structurally, a linked list is organized into a sequence or chain of nodes, hence the name. Two types of linked lists are commonly used: singly linked lists, where each node points to the next node and the last node points to null, and doubly linked lists, where each node has two links, one to the previous node and another one to the next. Linked Lists are used in other types of data structures like stacks and queues.

-<br>
 Learn more from the following links:

 - [Linked List Explained: from Basics to Advanced](https://www.freecodecamp.org/news/how-linked-lists-work/)