Augmented Linked Lists: An Essential Guide

Programming Tech Brief By HackerNoon

HackerNoon에서 제공하는 콘텐츠입니다. 에피소드, 그래픽, 팟캐스트 설명을 포함한 모든 팟캐스트 콘텐츠는 HackerNoon 또는 해당 팟캐스트 플랫폼 파트너가 직접 업로드하고 제공합니다. 누군가가 귀하의 허락 없이 귀하의 저작물을 사용하고 있다고 생각되는 경우 여기에 설명된 절차를 따르실 수 있습니다 https://ko.player.fm/legal.

11M ago 12:07

MP3•에피소드 홈

This story was originally published on HackerNoon at: https://hackernoon.com/augmented-linked-lists-an-essential-guide.
While a linked list is primarily a write-only and sequence-scanning data structure, it can be optimized in different ways.
Check more stories related to programming at: https://hackernoon.com/c/programming. You can also check exclusive content about #data-structures, #linked-lists, #memory-management, #linked-lists-explained, #how-does-a-linked-list-work, #hackernoon-top-story, #eviction-keys, #linked-list-guide, and more.
This story was written by: @amoshi. Learn more about this writer by checking @amoshi's about page, and for more stories, please visit hackernoon.com.
While a linked list is primarily a write-only and sequence-scanning data structure, it can be optimized in different ways. Augmentation is an approach that remains effective in some cases and provides extra capabilities in others.