Book “Data structures”

US$ 40.60*

Title:
Data structures

Editor:
By Wikipedians

Language:
English

Wiki page:
Book:Data structures

Categories:
Computer Science

Book size: ca. 734 pages






Share Tweet

Contents:

  • Chapter: Introduction
  • Data structure
  • Linked data structure
  • Succinct data structure
  • Implicit data structure
  • Compressed data structure
  • Search data structure
  • Static and dynamic data structures
  • Persistent data structure
  • Concurrent data structure
  • Chapter: Abstract data types
  • Abstract data type
  • List
  • Stack
  • Queue
  • Deque
  • Priority queue
  • Map
  • Bidirectional map
  • Multimap
  • Set
  • Tree
  • Chapter: Arrays
  • Array data structure
  • Row-major order
  • Dope vector
  • Iliffe vector
  • Dynamic array
  • Hashed array tree
  • Gap buffer
  • Circular buffer
  • Sparse array
  • Bit field
  • Bit array
  • Bitboard
  • Parallel array
  • Lookup table
  • Chapter: Lists
  • Linked list
  • XOR linked list
  • Unrolled linked list
  • VList
  • Skip list
  • Jump list
  • Self-organizing list
  • Chapter: Binary trees
  • Binary tree
  • Binary search tree
  • Self-balancing binary search tree
  • Tree rotation
  • Weight-balanced tree
  • Threaded binary tree
  • AVL tree
  • Red-black tree
  • AA tree
  • Scapegoat tree
  • Splay tree
  • T-tree
  • Rope
  • Top Trees
  • Tango Trees
  • Van Emde Boas tree
  • Cartesian tree
  • Treap
  • Chapter: B-trees
  • B-tree
  • B+ tree
  • B*-tree
  • B sharp tree
  • Dancing tree
  • 2-3 tree
  • 2-3-4 tree
  • Queaps
  • Fusion tree
  • Bx-tree
  • Chapter: Heaps
  • Heap
  • Binary heap
  • Binomial heap
  • Fibonacci heap
  • 2-3 heap
  • Pairing heap
  • Beap
  • Leftist tree
  • Skew heap
  • Soft heap
  • Ternary heap
  • D-ary heap
  • Chapter: Tries
  • Trie
  • Radix tree
  • Suffix tree
  • Suffix array
  • Compressed suffix array
  • FM-index
  • Generalised suffix tree
  • B-trie
  • Judy array
  • Directed acyclic word graph
  • Chapter: Multiway trees
  • Ternary search tree
  • And–or tree
  • (a,b)-tree
  • Link/cut tree
  • SPQR tree
  • Spaghetti stack
  • Disjoint-set data structure
  • Chapter: Space-partitioning trees
  • Space partitioning
  • Binary space partitioning
  • Segment tree
  • Interval tree
  • Range tree
  • Bin
  • Kd-tree
  • Implicit kd-tree
  • Min/max kd-tree
  • Adaptive k-d tree
  • Quadtree
  • Octree
  • Linear octrees
  • Z-order
  • UB-tree
  • R-tree
  • R+ tree
  • R* tree
  • Hilbert R-tree
  • X-tree
  • Metric tree
  • VP-tree
  • BK-tree
  • Chapter: Hashes
  • Hash table
  • Hash function
  • Open addressing
  • Lazy deletion
  • Linear probing
  • Quadratic probing
  • Double hashing
  • Cuckoo hashing
  • Coalesced hashing
  • Perfect hash function
  • Universal hashing
  • Linear hashing
  • Extendible hashing
  • 2-choice hashing
  • Pearson hashing
  • Fowler–Noll–Vo hash function
  • Bitstate hashing
  • Bloom filter
  • Locality preserving hashing
  • Morton number
  • Zobrist hashing
  • Rolling hash
  • Hash list
  • Hash tree
  • Prefix hash tree
  • Hash trie
  • Hash array mapped trie
  • Distributed hash table
  • Consistent hashing
  • Stable hashing
  • Koorde
  • Chapter: Graphs
  • Graph
  • Adjacency list
  • Adjacency matrix
  • And-inverter graph
  • Binary decision diagram
  • Binary moment diagram
  • Zero suppressed decision diagram
  • Propositional directed acyclic graph
  • Graph-structured stack
  • Scene graph
  • Chapter: Appendix
  • Big O notation
  • Amortized analysis
  • Locality of reference
  • Standard Template Library