Curriculum
- 5 Sections
- 52 Lessons
- 24 Weeks
Expand all sectionsCollapse all sections
- Course Overview/*! CSS Used from: Embedded */ *, ::after, ::before { box-sizing: border-box; border-width: 0; border-style: solid; border-color: #e5e7eb; } ::after, ::before { --tw-content: ''; } h2 { font-size: inherit; font-weight: inherit; } a { color: inherit; text-decoration: inherit; } h2, p { margin: 0; } :disabled { cursor: default; } *, ::before, ::after { --tw-border-spacing-x: 0; --tw-border-spacing-y: 0; --tw-translate-x: 0; --tw-translate-y: 0; --tw-rotate: 0; --tw-skew-x: 0; --tw-skew-y: 0; --tw-scale-x: 1; --tw-scale-y: 1; --tw-scroll-snap-strictness: proximity; --tw-ring-offset-width: 0px; --tw-ring-offset-color: #fff; --tw-ring-color: rgb(59 130 246 / 0.5); --tw-ring-offset-shadow: 0 0 #0000; --tw-ring-shadow: 0 0 #0000; --tw-shadow: 0 0 #0000; --tw-shadow-colored: 0 0 #0000; } .mx-auto { margin-left: auto; margin-right: auto; } .mb-2 { margin-bottom: 0.5rem; } .mb-4 { margin-bottom: 1rem; } .mb-6 { margin-bottom: 1.5rem; } .mr-2 { margin-right: 0.5rem; } .max-w-screen-sm { max-width: 640px; } .max-w-screen-xl { max-width: 1280px; } .rounded-lg { border-radius: 0.5rem; } .bg-primary-700 { --tw-bg-opacity: 1; background-color: rgb(29 78 216 / var(--tw-bg-opacity)); } .bg-white { --tw-bg-opacity: 1; background-color: rgb(255 255 255 / var(--tw-bg-opacity)); } .px-4 { padding-left: 1rem; padding-right: 1rem; } .px-5 { padding-left: 1.25rem; padding-right: 1.25rem; } .py-2.5 { padding-top: 0.625rem; padding-bottom: 0.625rem; } .py-8 { padding-top: 2rem; padding-bottom: 2rem; } .text-center { text-align: center; } .text-4xl { font-size: 3rem; line-height: 2.5rem; } .text-sm { font-size: 0.875rem; line-height: 1.25rem; } .font-extrabold { font-weight: 800; } .font-light { font-weight: 300; } .font-medium { font-weight: 500; } .leading-tight { line-height: 1.25; } .tracking-tight { letter-spacing: -0.025em; } .text-gray-500 { --tw-text-opacity: 1; color: rgb(107 114 128 / var(--tw-text-opacity)); } .text-gray-900 { --tw-text-opacity: 1; color: rgb(17 24 39 / var(--tw-text-opacity)); } .text-white { --tw-text-opacity: 1; color: rgb(255 255 255 / var(--tw-text-opacity)); } .hover\:bg-primary-800:hover { --tw-bg-opacity: 1; background-color: rgb(30 64 175 / var(--tw-bg-opacity)); } .focus\:outline-none:focus { outline: 2px solid transparent; outline-offset: 2px; } .focus\:ring-4:focus { --tw-ring-offset-shadow: var(--tw-ring-inset) 0 0 0 var(--tw-ring-offset-width) var(--tw-ring-offset-color); --tw-ring-shadow: var(--tw-ring-inset) 0 0 0 calc(4px + var(--tw-ring-offset-width)) var(--tw-ring-color); box-shadow: var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow, 0 0 #0000); } .focus\:ring-primary-300:focus { --tw-ring-opacity: 1; --tw-ring-color: rgb(147 197 253 / var(--tw-ring-opacity)); } @media (min-width: 640px) { .sm\:py-16 { padding-top: 4rem; padding-bottom: 4rem; } } @media (min-width: 768px) { .md\:text-lg { font-size: 1.5rem; line-height: 1.75rem; } } @media (min-width: 1024px) { .lg\:px-6 { padding-left: 1.5rem; padding-right: 1.5rem; } } .imgdata { width: 35% } @media (max-width: 767px) { .imgdata { width: 40% } } .course-payment { display: none !important; } .thim-course-landing-button { display: none !important; }0
- Index32
- 2.1Introduction of Data Structure8 Minutes
- 2.2Types Of Data Structures6 Minutes
- 2.3Operations Of Data Structures6 Minutes
- 2.4Concept Of Abstract Data Type6 Minutes
- 2.5Array Part #116 Minutes
- 2.6Array Part #219 Minutes
- 2.7Introduction To Stack5 Minutes
- 2.8Operations Of Stack ADT6 Minutes
- 2.9Stack Implementation Using Array Part #110 Minutes
- 2.10Stack Implementation Using Array Part #212 Minutes
- 2.11Introduction Of Queue5 Minutes
- 2.12Operations Of Queue ADT4 Minutes
- 2.13Queue Implementation Using Array Part #111 Minutes
- 2.14Queue Implementation Using Array Part #29 Minutes
- 2.15Circular Queue Implementation Part #112 Minutes
- 2.16Circular Queue Implementation Part #28 Minutes
- 2.17Introduction To Linked Lists6 Minutes
- 2.18Array Vs Linked List8 Minutes
- 2.19Linked List Implementation Part #117 Minutes
- 2.20Linked List Implementation Part #211 Minutes
- 2.21Linked List Part #310 Minutes
- 2.22Linked List Part #415 Minutes
- 2.23Linked List Implementation Part #511 Minutes
- 2.24Linked List Implementation Part #610 Minutes
- 2.25Stack Using Linked List Part #19 Minutes
- 2.26Stack Using Linked List Part #26 Minutes
- 2.27Queue Using Linked List Part #110 Minutes
- 2.28Queue Using Linked List Part #26 Minutes
- 2.29Circular Queue Using Linked List9 Minutes
- 2.30Implementation Of Doubly Linked List Part #113 Minutes
- 2.31Doubly Linked List Part #27 Minutes
- 2.32Doubly Linked List Part #39 Minutes
- Notes7
- Data Structures Viva Question6
- Importance7
Implementation Of Doubly Linked List Part #1
Implementation Of Doubly Linked List Part #1
In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains three fields: two link fields (references to the previous and to the next node in the sequence of nodes) and one data field. Doubly linked list allows element two way traversal. On other hand doubly linked list can be used to implement stacks as well as heaps and binary trees. Singly linked list is preferred when we need to save memory and searching is not required as pointer of single index is stored.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placement-preparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!