跳到主要内容

3 篇文档带有标签「data-structure」

查看所有标签

Graph Structures

Adjacency matrices, adjacency lists, topological sort and union-find: how a graph is stored decides which algorithm is cheap.

Linear Structures

Arrays, linked lists, stacks, queues and hash tables: the storage trade-offs behind every collection API.

Trees & Heaps

Binary trees, red-black trees, B-trees, B+ trees and heaps: the balance and fan-out choices behind ordered data.