Fundamentals of Data StructuresArrays; Stacks and queues; Linked lists; Trees; Graphs; Internal sorting; External sorting; Symbol tables; Files. |
Other editions - View all
Common terms and phrases
accesses ACM member adjacency lists adjacency matrix allocation assume available space list AVL tree B-tree binary search tree binary tree bucket circular list computing configuration data structure defined delete determine disk doubly linked list edges elements empty end end example exercise FORTRAN game tree graph hash function hash table head node identifiers initial inorder insertion integer internal sort iteration k-way merge key value length link field linked list list node loop maximum number memory move needed number of nodes O(n² obtain operations output pointer polynomials problem procedure processing queue Quicksort R₁ records recursive representation represented requires result retrieval right subtree RLINK sequence sequential shortest path spanning tree SPARKS sparse matrix stack statement storage stored string tape threaded binary tree total number tree of figure undirected graph variables vertex vertices Write an algorithm zero