data structures

Arrays, trees, stacks

Data structures are ways of organizing and storing information in a computer so it can be accessed and modified efficiently.

Arrays hold ordered sequences, trees represent hierarchies, hash tables enable quick lookups by key.

Choosing the right data structure affects how fast programs run: The interview focused heavily on data structures and algorithms.

types

array

Ordered collection or display

tree · graph · hash table · set · map · heap · B-tree · matrix · tuple · record

hierarchy

tree

Woody perennial plant

  • binary treeTwo-way branching data structure
  • heapJumbled collection of items
  • rootUnderground absorbing structure

branch · leaf · depth · level · ancestor · descendant · subtree · balanced · complete · full

operations

insertion

Placing something within

sorting · access · update · push · pop · enqueue · dequeue · lookup · hashing · balancing

components

node

Connection point in networks

  • vertexPoint where edges converge
  • edgeBoundary or sharpness
  • pointerReference to memory location

key · value · index · element · bucket · slot · head · tail · root · leaf

applications

memory management

Coordinating program RAM usage

social graph

efficiency

logarithmic

Based on exponents

worst case · trade-off · random access

graphs

cycle

Repeating sequence of events

dense · sparse · acyclic

Categories
Opposites
organization

data structuresraw data

Unanalyzed collected information

entropy · noise · raw input · blob · random access memory

abstraction level

data structuresalgorithms

Finite instruction sequences

machine code · operations · procedures · functions · processes

Family

data, infrastructure, structural, structures, restructure, restructuring, structurally, structuralism, superstructure

Familiarity
Top 200,000
Profile
Used worldwide · Timeless · Abstract · Rated G