Data Structures Portal

date2026-07-14document_iddoc_878bc39cd4899a0274b9df21eb30b97cdescriptionデータ構造を抽象データ型と実装に区別し、各構造の操作契約、計算量、用途を学ぶ順序を示す。type講義statusactive

portalalgorithmdata-structureslecture

data/lecture/information/algorithm/foundation/computational-complexity-basics.lecture.n.md

1Introduction

This sequence distinguishes the operations provided by a data structure from the implementation that realizes them and explains how to select a structure appropriate for a task.

2Abstract data types and implementations

An abstract data type (ADT) specifies a contract for the values it stores and the operations available to clients. An implementation is a concrete realization of that contract using an array, linked list, tree, or another representation. Two implementations of the same ADT can have different time and space complexities.

Each lecture examines operation preconditions and postconditions, behavior on an empty structure, implementation assumptions, and complexity, in that order.

3Learning order

Stacks and queues define LIFO and FIFO removal orders and connect them to candidate management in DFS and BFS.
Hash tables address key-based lookup and collision handling.
Trees and heaps address hierarchical structure and priority-based operations.
Disjoint-set data structures address set union and membership queries.

data/lecture/information/algorithm/data-structures/stack-and-queue-basics.lecture.n.md data/lecture/information/algorithm/data-structures/hash-table-basics.lecture.n.md data/lecture/information/algorithm/data-structures/tree-and-heap-basics.lecture.n.md data/lecture/information/algorithm/data-structures/union-find-basics.lecture.n.md