Linked Lists: Value and Next-Pointer Columns, Walking the List, Inserting by Re-Pointing
This lesson is part of the course
In this lesson
You follow next-pointers through a sorted linked list whose nodes are scattered over eight slots, read the value at every step, find where a new value belongs and set its next-pointer with INDEX and MATCH, then compare the work with an array.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Arrays and Indices: Positions from 0, Reading by Index, Element Addresses and the Cost of Inserting Locked
- Stacks: a Push/Pop Log, the Top Pointer per Step, the Value on Top and Balanced Brackets Locked
- Queues and Ring Buffers: Head and Tail Pointers, Wrap-Around with MOD, Full and Empty Flags Locked
- Linked Lists: Value and Next-Pointer Columns, Walking the List, Inserting by Re-Pointing Locked
- Binary Heaps: a Tree Stored in an Array, Parent and Child Indices, Sift-Up Step by Step Locked
- Binary Search Trees: Levels of the Nodes, the Path of Comparisons for a New Key, Balanced vs Degenerate Locked
- Sorting Passes: Bubble Sort Pass by Pass, Swaps per Pass, Insertion Shifts and the Merge Step Locked
- Capstone – Pick the Structure: Steps per Operation, Total Steps for a Workload, the Winner and a Chart Locked