Abstract Data Types and Algorithms |
Contents
Abstract Data Types and Program Design | 25 |
Elementary Linear ADTS | 48 |
Nonlinear ADTS Trees | 90 |
Copyright | |
10 other sections not shown
Common terms and phrases
abstract data type arcs array assignment assume AVL trees b_search B-tree begin binary search tree binary tree boolean chapter characters complexity component construct Cset cycle data structures defined delete digraph Dijkstra's algorithm divide and conquer dynamic programming ebuf efficient elements elems empty end end equal evaluate example exercise expression false Figure frontier function returns graph G hash table hashing function heapsort identifier implementation in-order input insertion sort instance integer linear loop mapping matching matrix maximum MCST merge sort node NP-complete O(log O(n log O(nē operations PAIR_SET pairs Pascal pattern pointer polynomial pop(S position priority queue priority_queue problem push(s quicksort recursive represented Reverse Polish right subtree root S₁ sequence shortest simple solution sorting algorithms split stack storage stored string sub-lists sub-problems symbol techniques temp tion top(S tour traversal V₁ variable weighted path length