-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
41 lines (40 loc) · 1.88 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>DSA Journey</title>
<link rel="stylesheet" href="style.css">
</head>
<body>
<h1>Journey</h1>
<div class="container">
<div class="card">
<a href="/DSA/Basic/basics_of_cpp"><h2>Introduction</h2></a>
<p>Data Structures and Algorithms (DSA) are the building blocks of computer science. They are essential for writing efficient and scalable code.</p>
<div class="card">
<h2>Array</h2>
<p>Array is a collection of similar data types. It is a linear data structure that stores elements in a contiguous memory location.</p>
</div>
<div class="card">
<h2>Linked List</h2>
<p>Linked List is a linear data structure. It is a collection of nodes where each node consists of a data field and a reference(link) to the next node in the list.</p>
</div>
<div class="card">
<h2>Stack</h2>
<p>Stack is a linear data structure that follows the Last In First Out (LIFO) principle. It has two main operations: push and pop.</p>
</div>
<div class="card">
<h2>Queue</h2>
<p>Queue is a linear data structure that follows the First In First Out (FIFO) principle. It has two main operations: enqueue and dequeue.</p>
</div>
<div class="card">
<h2>Tree</h2>
<p>Tree is a non-linear data structure that consists of nodes connected by edges. It is used to represent hierarchical relationships.</p>
</div>
<div class="card">
<h2>Graph</h2>
<p>Graph is a non-linear data structure that consists of vertices (nodes) connected by edges. It is used to represent networks.</p>
</div>
</body>
</html>Initial commit