update

Author: goel4ever

src/data-structure/graph/index.md

@@ -1,4 +1,4 @@
-### Understanding Graphs
+# Understanding Graphs
 
 A graph is a collection of nodes (also called vertices) and edges that connect pairs of nodes. Graphs can be:
 - **Directed or Undirected:** In a directed graph, edges have a direction, while in an undirected graph, edges do not.

src/data-structure/queue/index.md

@@ -1,3 +1,3 @@
-### Understanding Queue
+# Understanding Queue
 
 A queue is a linear data structure that follows the First-In-First-Out (FIFO) principle, where elements are inserted from one end called the rear (or back) and removed from the other end called the front. This makes queues ideal for scenarios where the order of operations matters, such as task scheduling, handling requests in a web server, or managing tasks in an operating system.

src/data-structure/stack/index.md

@@ -1,3 +1,3 @@
-### Understanding Stack
+# Understanding Stack
 
 A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle, where elements are added (pushed) and removed (popped) from the same end, referred to as the top of the stack. Stacks are used in various applications such as expression evaluation, backtracking algorithms, and function call management in programming languages.