You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/dsa/linkedlist/LinkedList.md
-11Lines changed: 0 additions & 11 deletions
Original file line number
Diff line number
Diff line change
@@ -48,17 +48,6 @@ A linked list can be declared in various programming languages using the followi
48
48
49
49
# LinkedList in Data Structures and Algorithms (DSA)
50
50
51
-
## Table of Contents
52
-
53
-
1.[Introduction](#introduction)
54
-
2.[Types of Linked Lists](#types-of-linked-lists)
55
-
3.[Basic Operations](#basic-operations)
56
-
4.[Advantages and Disadvantages](#advantages-and-disadvantages)
57
-
5.[Applications](#applications)
58
-
6.[Common Linked List Problems](#common-linked-list-problems)
59
-
7.[Advanced Linked List Techniques](#advanced-linked-list-techniques)
60
-
8.[Resources and References](#resources-and-references)
61
-
62
51
## Introduction
63
52
64
53
A linked list is a fundamental data structure in computer science that represents a sequence of nodes. Each node contains data and a reference to the next node in the sequence.
0 commit comments