---
id: java-linkedlist
title: "Java LinkedList"
category: "Programming_Language"
status: "draft"
verification_status: "conceptual"
canonical_id: ""
aliases: ["자바 LinkedList"]
duplicate_of: ""
source_trust_level: "B"
confidence_score: 0.9
created_at: 2026-07-04
updated_at: 2026-07-04
review_reason: ""
merge_history: []
tags: ["java", "programming", "w3schools", "collections-framework", "linkedlist"]
raw_sources: ["https://www.w3schools.com/java/java_linkedlist.asp"]
applied_in: []
github_commit: ""
---

# [[Java LinkedList]]

## 🎯 한 줄 통찰 (One-line insight)
ArrayList and LinkedList share the exact same List-interface methods (add/remove/set/clear) but have fundamentally different internal storage — ArrayList uses a real array that gets reallocated/copied when full, while LinkedList uses independently-linked "containers," which is why LinkedList is recommended for manipulation (insert/remove) while ArrayList wins for random access. [S1]

## 🧠 핵심 개념 (Core concepts)
- **`LinkedList`** — nearly identical API to ArrayList; both implement `List`. [S1]
- **Internal difference: array vs. containers** — ArrayList grows by copying into a new larger array; LinkedList links independent containers together. [S1]
- **Use-case split** — ArrayList for storing/accessing data (random access); LinkedList for manipulating data (frequent insert/remove). [S1]
- **LinkedList-specific methods** — `addFirst()`, `addLast()`, `removeFirst()`, `removeLast()`, `getFirst()`, `getLast()`. [S1]
- **`var` keyword and List-typed variables** — same patterns as ArrayList (`var cars = new LinkedList<String>();`, `List<String> cars = new LinkedList<>();`). [S1]

## 📖 세부 내용 (Details)
- Basic creation: `LinkedList<String> cars = new LinkedList<String>(); cars.add("Volvo"); cars.add("BMW");`. [S1]
- Container-based internal structure: each container links to the next; adding an element creates a new container linked into the chain (contrasted with ArrayList's array-copy growth). [S1]
- LinkedList-specific methods: `addFirst()`, `addLast()`, `removeFirst()`, `removeLast()`, `getFirst()`, `getLast()`. [S1]

## ⚖️ 모순 및 업데이트 (Contradictions & updates)
- **효율성 트레이드오프**: 무작위 접근이 잦으면 ArrayList가 더 효율적이지만, 특정 삽입/삭제 연산은 LinkedList 전용 메서드가 더 효율적이라는 점이 명시됨. [S1]

## 🛠️ 적용 사례 (Applied in summary)
현재 발견된 실제 적용 사례가 없습니다 — 데이터 접근이 목적이면 ArrayList, 데이터 조작(삽입/삭제)이 목적이면 LinkedList를 선택하는 것이 실전 가이드다. [S1]

## 💻 코드 패턴 (Code patterns)
LinkedList-specific first/last methods (Java):
```java
LinkedList<String> cars = new LinkedList<String>();
cars.add("Volvo");
cars.addFirst("Mazda"); // add to the beginning
cars.addLast("BMW");    // add to the end
```

## ✅ 검증 상태 및 신뢰도
- **상태:** draft
- **검증 단계:** conceptual
- **출처 신뢰도:** B (W3Schools — widely used educational reference, not a primary standards body)
- **신뢰 점수:** 0.90
- **중복 검사 결과:** 신규 생성 (New discovery)

## 🔗 지식 그래프 (Knowledge Graph)
- **상위/루트:** [[Java Tutorial]]
- **관련 개념:** [[Java ArrayList]], [[Java List]], [[Java Sort List]]
- **참조 맥락:** ArrayList의 대안 구현체 — 정렬(Sort List) 챕터로 이어짐.

## 📚 출처 (Sources)
- [S1] W3Schools — Java LinkedList — https://www.w3schools.com/java/java_linkedlist.asp

## 📝 변경 이력 (Change history)
- 2026-07-04: Initial draft synthesized from the W3Schools "Java LinkedList" page (Astra wiki-curation, P-Reinforce v3.1 format).
