Graph - A set of nodes connected by arcs, Tree - A connected, undirected graph with no cycles, Binary Tree - Tree where each node has maximum of two branches, Hash Table - ADT with O(1) average search, Stack - FILO, Dictionary - ADT made up of (key, value) pairs, Leaf - A node with no sub-nodes, Root - The start node of a tree, Adjacency Matrix - Inefficient representation of a sparse graph, Adjacency List - Inefficient representation of a highly connected graph, Collision - Results of two items hashing to the same value,

A-Level.U7.Data Structures T4-7

만든이
인쇄
퍼가기

순위표

비주얼 스타일

옵션

템플릿 전환하기

자동 저장된 게임을 복구할까요?