Linked Lists

This set of flashcards covers key concepts related to linked lists, including their structure, methods of insertion and deletion, and differences from arrays.

Linked List

A data structure suitable for use in many types of general-purpose databases, where each data item is embedded in a link or a node.

Node

An object that contains data and a reference to the next node in a linked list.

Reference

A number that refers to an object, typically representing the object's address in memory.

Insert First

A method that inserts a new link at the beginning of the linked list.

Delete First

A method that disconnects and removes the first link in the linked list.

Self-referential Class

A class that includes a field that references an object of the same class.

Double-Ended List

A linked list that has references to both the first and last links, allowing insertion at both ends.

Sorted List

A linked list where items are arranged in sorted order by key value.

Doubly Linked List

A linked list in which each node has two references: one to the next node and one to the previous node.

Efficiency of Linked Lists

Insertion and deletion at the beginning of a linked list are O(1), while finding and inserting next to a specific item is O(N).