Schaum's Outline of Theory and Problems of Data StructuresString processing -- Arrays, records, and pointers -- Linked lists -- Stacks, queues, recursion -- Trees -- Graphs and their applications -- Sorting and searching. |
Contents
INTRODUCTION AND OVERVIEW | 1 |
ARRAYS RECORDS AND POINTERS | 67 |
LINKED LISTS | 114 |
Copyright | |
5 other sections not shown
Other editions - View all
Common terms and phrases
Accordingly adjacency matrix assigned AVAIL list binary search algorithm binary search tree binary tree bubble sort called character Consider data structure denote deque directed graph edges empty End of loop End of Step EXAMPLE Exit Find the number finds the location FRONT function given graph G header node heapsort Hence INDEX(T INFO INFO[PTR initial inorder inserted integer last node left child length linear array linear search LINK[PTR linked list linked representation location LOC LOCP memory cells Module notation Observe one-way list operations P₁ pictured in Fig pointer variable postorder postorder traversal preorder priority queue Prob processing quicksort REAR record recursive Repeat Steps right child root row-major order SAN DIEGO search algorithm Set LOC Set PTR sort algorithm STACK stored string sublist subprogram substring subtree T₁ Test the program topological sort v₁ Write a procedure Write a program