Data Structures Using PASCALInformation and meaning; The stack; Recursion; Queues and list; Pascal list processing; Graphs and their applications; Sorting; Searching; Scalar types in Pascal; Using one-dimensional arrays; Packed arrays; Arrays parameters; Value and variable parameters; Records in Pascal; Arrays of records; Scope identifiers; The with statement; Efficiency of record access; Packed records; Files of records. |
Contents
ARRAYS AND SETS IN PASCAL | 15 |
RECORDS IN PASCAL | 41 |
THE STACK | 56 |
Copyright | |
35 other sections not shown
Other editions - View all
Common terms and phrases
adjacency matrix algorithm allocated binary search tree binary tree boolean bubble sort bytes char character string circular list column complete binary tree const currarea data area data structure declared defined deleted digits disk doubly linked list efficient empty end else begin end for...do begin end function end procedure end then begin end while...do begin equal example field flight flow function freenode getnode graph nodes hash hash function header node implementation initial inorder insert insertion sort integer leaf matrix method nodeptr nodetype number of comparisons operands operation packed array parameter Pascal program Pascal routine passenger pointer position postfix prefix queue quicksort recursive recursive call representation represented returns right subtree root Section semipath shell sort simulation sort stack statement storage subarray subfiles symb symbol tion traverse tree of Figure variable Write a Pascal