{"id":10251,"date":"2025-10-31T19:31:03","date_gmt":"2025-10-31T14:01:03","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=10251"},"modified":"2025-10-31T19:38:44","modified_gmt":"2025-10-31T14:08:44","slug":"introduction-to-linked-list_","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/introduction-to-linked-list_\/","title":{"rendered":"Introduction to Linked List"},"content":{"rendered":"\n<!-- PrismJS for Syntax Highlighting -->\n<link href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.min.css\" rel=\"stylesheet\">\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.min.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style>\n.wp_blog_theme {\n  --primary: #E58C32;\n  --secondary: #030302;\n  --light-bg: #fef9f4;\n  --text-dark: #2d2d2d;\n  --tab-radius: 12px;\n  --shadow: 0 4px 12px rgba(0, 0, 0, 0.08);\n  --code-bg: #001f3f;\n  --code-text: #d4f1ff;\n}\n\n.wp_blog_container {\n  font-family: 'Segoe UI', sans-serif;\n  background: var(--light-bg);\n  margin: 0;\n  padding: 0;\n  color: var(--text-dark);\n}\n\n\/* Heading *\/\n.wp_blog_main-heading {\n  text-align: center;\n  font-size: 2.4rem;\n  color: var(--primary);\n  margin-top: 2.5rem;\n  font-weight: bold;\n}\n\n\/* Explanation Card *\/\n.wp_blog_explanation,\n.wp_blog_code-tabs-container {\n  max-width: 940px;\n  margin: 2rem auto;\n  padding: 2rem;\n  background: white;\n  border-radius: var(--tab-radius);\n  box-shadow: var(--shadow);\n}\n\n\/* Text and Visuals *\/\n.wp_blog_explanation h2 {\n  font-size: 1.4rem;\n  color: var(--primary);\n  margin-bottom: 0.5rem;\n}\n\n.wp_blog_explanation p,\n.wp_blog_explanation li {\n  font-size: 1.05rem;\n  line-height: 1.7;\n  margin: 0.5rem 0;\n}\n\n.wp_blog_explanation code {\n  background: #fef9f4;   \/* light bg instead of dark blue *\/\n  color: #E58C32;        \/* brand orange *\/\n  padding: 3px 6px;\n  border-radius: 4px;\n  font-family: 'Courier New', monospace;\n  font-weight: 600;      \/* optional, makes it pop *\/\n}\n\n.wp_blog_explanation img {\n  max-width: 100%;\n  border-radius: var(--tab-radius);\n  margin-top: 1rem;\n  box-shadow: 0 2px 12px rgba(0, 0, 0, 0.06);\n}\n\n\/* Tab Buttons *\/\n.wp_blog_code-tabs-header {\n  display: flex;\n  flex-wrap: wrap;\n  gap: 0.5rem;\n  margin-bottom: 1rem;\n}\n\n.wp_blog_code-tab-button {\n  padding: 0.6rem 1.2rem;\n  border: 1px solid var(--primary);\n  background: white;\n  color: var(--primary);\n  border-radius: 50px;\n  font-weight: 600;\n  cursor: pointer;\n  transition: all 0.3s ease;\n}\n\n.wp_blog_code-tab-button:hover {\n  background: var(--secondary);\n}\n\n.wp_blog_code-tab-button.active {\n  background: var(--primary);\n  color: white;\n}\n\n\/* Code Content *\/\n.wp_blog_code-tab-content {\n  display: none;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n}\n\n.wp_blog_code-tab-content.active {\n  display: block;\n}\n\n.wp_blog_code-tab-content pre {\n  margin: 0;\n  padding: 1.5rem;\n  font-size: 1rem;\n  overflow-x: auto;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n  color: var(--code-text);\n}\n\n\/* Dark mode variables *\/\n.wp_blog_theme.dark-mode {\n  --light-bg: #121212;\n  --text-dark: #f5f5f5;\n  --shadow: 0 4px 12px rgba(255, 255, 255, 0.08);\n  --code-bg: #1e1e1e;\n  --code-text: #c5f0ff;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_explanation {\n  background: #1e1e1e;\n}\n\n\/* Dark mode code highlight *\/\n.wp_blog_theme.dark-mode .wp_blog_explanation code {\n  background: #333;\n  color: #ffd27f;\n}\n\n.wp_blog_theme {\n  position: relative; \/* makes it the reference for absolute children *\/\n}\n\n.wp_blog_toggle-btn {\n  position: absolute;\n  top: 1rem;\n  right: 1rem;\n  z-index: 9999;\n  padding: 0.5rem 0.8rem;\n  border-radius: 10%;\n  background: var(--primary);\n  color: white;\n  font-weight: bold;\n  cursor: pointer;\n  border: none;\n  box-shadow: var(--shadow);\n  transition: background 0.3s, transform 0.2s;\n}\n\n.wp_blog_toggle-btn:hover {\n  background: #cc772e;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_code-tabs-container {\n  background: #1e1e1e;\n}\n<\/style>\n\n<div class=\"wp_blog_container wp_blog_theme\">\n  <button id=\"blogNotesThemeToggle\" class=\"wp_blog_toggle-btn\">\ud83c\udf19<\/button>\n  <h1 class=\"wp_blog_main-heading\"><\/h1>\n\n  <div class=\"wp_blog_explanation\">\n    <h2>Linked List<\/h2>\n    <p><strong>A Linked List is a linear data structure in which elements (called nodes) are connected using pointers.<\/strong><\/p>\n    <ul>\n        <li><code>Each node contains<\/code>\n        <ul>\n            <li>A value (the actual data).<\/li>\n            <li>A reference (or pointer) to the next node (and optionally to the previous node in doubly linked lists).<\/li>\n        <\/ul>\n        <\/li>\n    <\/ul>\n   \n    <h2>Types of Linked Lists<\/h2>\n    <ul>\n        <li><strong>Value: <\/strong>The data part<\/li>\n        <li><strong>Next: <\/strong>a pointer\/reference to the next node.<\/li>\n        <li>It moves only in one direction (forward).<\/li>\n        <li><strong>Structure:<\/strong> Structure: [value | next] -> [value | next] -> [value | null]<\/li>\n       <hr\/>\n       \n        <li><strong>Value: <\/strong>The data<\/li>\n        <li><strong>next:<\/strong> pointer to the next node<\/li>\n        <li><strong>prev:<\/strong> pointer to the previous node<\/li>\n        <li>Allows bidirectional traversal<\/li>\n        <li><strong>Structure:<\/strong> null <- [prev | value | next] <-> [prev | value | next] -> null<\/li>\n    <\/ul>\n\n<h2>Key Terminologies<\/h2>\n<ul>\n    <li><code>Head: <\/code>The first node of a linked list. It marks the entry point and points to the next node.<\/li>\n    <li><code>Tail: <\/code>The last node of a linked list. It points to null because there\u2019s no node after it.<\/li>\n    <li><code>Linked List Representation: <\/code>It is typically represented using its head node.<\/li>\n<\/ul>\n\n<h2>Array vs Linked List \u2014 Comparison Table:<\/h2>\n  <table border=\"1\" cellpadding=\"6\" cellspacing=\"0\">\n    <thead>\n      <tr>\n        <th>Feature<\/th>\n        <th>Array<\/th>\n        <th>Linked List<\/th>\n      <\/tr>\n    <\/thead>\n    <tbody>\n      <tr>\n        <td><strong>Type<\/strong><\/td>\n        <td>Linear data structure where elements are arranged in a sequence using indexes.<\/td>\n        <td>Linear data structure where each element (node) points to the next, forming a chain.<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Memory Layout<\/strong><\/td>\n        <td>Elements are stored in a contiguous (adjacent) block of memory.<\/td>\n        <td>Each node is stored separately and connected via pointers, allowing scattered memory locations.<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Size<\/strong><\/td>\n        <td>Size must be known or defined initially. Resizing is expensive if needed later.<\/td>\n        <td>Size is dynamic. Nodes can be added or removed without knowing the size in advance.<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Data Stored<\/strong><\/td>\n        <td>Only values are stored (e.g., integers, strings, etc.)<\/td>\n        <td>Each node stores a value along with one or more pointers (to next and\/or previous nodes).<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Access Time (Indexing)<\/strong><\/td>\n        <td>Direct access using index (e.g., <code>arr[3]<\/code>) is fast with time complexity O(1).<\/td>\n        <td>Sequential access only. To get a value, you must start at the head and traverse node by node. Time complexity O(n).<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Insertion\/Deletion<\/strong><\/td>\n        <td>Inserting or deleting in the middle requires shifting elements. Can be time-consuming.<\/td>\n        <td>Insertion and deletion are faster, especially at the beginning or end, as it only involves pointer changes.<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Memory Efficiency<\/strong><\/td>\n        <td>Efficient memory usage as no extra space is needed for pointers.<\/td>\n        <td>Extra memory is used to store pointers (next\/prev), making it less memory efficient.<\/td>\n      <\/tr>\n    <\/tbody>\n  <\/table>\n\n<h2>Use Cases: When to Use What?<\/h2>\n  <table border=\"1\" cellpadding=\"6\" cellspacing=\"0\">\n    <thead>\n      <tr>\n        <th>Use Case<\/th>\n        <th>Prefer<\/th>\n      <\/tr>\n    <\/thead>\n    <tbody>\n      <tr>\n        <td><strong>Access elements by index fast<\/strong><\/td>\n        <td><strong>Array<\/strong> \u2013 Arrays provide direct access to elements using an index, making it very fast (O(1)). Ideal when random access is frequent.<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Frequent insertions\/deletions at head or tail<\/strong><\/td>\n        <td><strong>Linked List<\/strong> \u2013 Inserting or removing nodes at the beginning or end is efficient in linked lists since you just change a few pointers (O(1)).<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Static-sized data with memory-efficient storage<\/strong><\/td>\n        <td><strong>Array<\/strong> \u2013 Arrays are more memory-efficient as they don\u2019t use extra space for pointers. Best when the number of elements is fixed or predictable.<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Unknown size or avoid resizing overhead<\/strong><\/td>\n        <td><strong>Linked List<\/strong> \u2013 Since linked lists grow as needed, they are a better choice when the size of the data is not known upfront or changes frequently.<\/td>\n      <\/tr>\n      <tr>\n        <td><strong>Do a lot of traversal or manipulation<\/strong><\/td>\n        <td><strong>Linked List<\/strong> \u2013 When you need to move around, insert or remove nodes repeatedly, linked lists offer better flexibility for such operations.<\/td>\n      <\/tr>\n    <\/tbody>\n  <\/table>\n<\/div>\n<\/div>\n\n<script>\ndocument.addEventListener(\"DOMContentLoaded\", () => {\n  const buttons = document.querySelectorAll(\".wp_blog_code-tab-button\");\n  const contents = document.querySelectorAll(\".wp_blog_code-tab-content\");\n\n  buttons.forEach((button) => {\n    button.addEventListener(\"click\", () => {\n      const lang = button.getAttribute(\"data-lang\");\n\n      buttons.forEach((btn) => btn.classList.remove(\"active\"));\n      contents.forEach((content) => content.classList.remove(\"active\"));\n\n      button.classList.add(\"active\");\n      document\n        .querySelector(`.wp_blog_code-tab-content[data-lang=\"${lang}\"]`)\n        .classList.add(\"active\");\n    });\n  });\n\n  const themeToggle = document.getElementById(\"blogNotesThemeToggle\");\n  const themeContainer = document.querySelector(\".wp_blog_theme\");\n\n  themeToggle.addEventListener(\"click\", () => {\n    themeContainer.classList.toggle(\"dark-mode\");\n    themeToggle.textContent =\n      themeContainer.classList.contains(\"dark-mode\") ? \"\u2600\ufe0f\" : \"\ud83c\udf19\";\n  });\n});\n<\/script>\n\n","protected":false},"excerpt":{"rendered":"<p>\ud83c\udf19 Linked List A Linked List is a linear data structure in which elements (called nodes) are connected using pointers. Each node contains A value (the actual data). A reference (or pointer) to the next node (and optionally to the previous node in doubly linked lists). Types of Linked Lists Value: The data part Next:<\/p>\n","protected":false},"author":108,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[322,260,176,175,211,810,174,172],"tags":[],"class_list":["post-10251","post","type-post","status-publish","format-standard","category-algorithms-and-data-structures","category-c-c-plus-plus","category-csharp","category-cplusplus","category-data-structures","category-dsa","category-java","category-javascript"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/10251","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/108"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=10251"}],"version-history":[{"count":1,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/10251\/revisions"}],"predecessor-version":[{"id":10777,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/10251\/revisions\/10777"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=10251"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=10251"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=10251"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}