## Schaum's outline of theory and problems of data structuresAn introduction to data organization includes discussions of algorithms, arrays, string processing, linked lists, and binary trees |

### What people are saying - Write a review

User Review - Flag as inappropriate

One of the best book for data structures.

### Contents

Chapter INTRODUCTION AND OVERVIEW | 1 |

PRELIMINARIES | 17 |

STRING PROCESSING | 41 |

Copyright | |

7 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 items 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 log2 memory cells Module notation NULL Observe one-way list operations 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 search algorithm Set LOC Set PTR sort algorithm STACK stored string sublist subprogram substring subtree Test the program topological sort Write a procedure Write a program