What people are saying - Write a review
We haven't found any reviews in the usual places.
A SIMPLE EXAMPLE OF LINKED AND SEQUENTIAL REPRE
LINEAR DATA STRUCTURES
ALTERNATIVE REPRESENTATIONS OF LINEAR STRUCTURES
8 other sections not shown
abstract acyclic adjacency matrix algorithm allocation assigned values assignment functions associated assume available blocks available cells AVL tree B-tree begin pointer binary tree bsearch bucket called celsiz component computer representation data structure defined deletion denote directed graph edge elements example EXERCISES FOR SECTION exit expression Fortran free pool GIVEME given graph G hashing function header cell homomorphism identified implemented input integer Knuth transform language left neighbor length linear link fields linked list linked representation list structure lookup matrix name cell next(cell null nullvalue operations page faults path postorder postorder traversal preceding preorder principal trees procedure programming language queue records recursive referenced relation represented retrieval returns right neighbors routines sequence sequential representation shown in Fig simply stack stored string subgraph sublist symbol table TAKEIT Theorem tion topological sort traversal virtual memory word