Handbook of Data Structures and Applications, 2nd Edition

I

Fundamentals

1Analysis of Algorithms Sartaj Sahni

Introduction•Operation Counts•Step Counts•Counting Cache Misses•Asymptotic Complexity•Recurrence Equations•Amortized Complexity•Practical Complexities•Acknowledgments•References

2Basic Structures Dinesh P. Mehta

Introduction•Arrays•Linked Lists•Stacks and Queues•Acknowledgments•References

3Trees Dinesh P. Mehta

Introduction•Tree Representation•Binary Trees and Properties•Binary Tree Traversals•Threaded Binary Trees•Binary Search Trees•Heaps•Tournament Trees•Acknowledgments•References

4Graphs Narsingh Deo

Introduction•Graph Representations•Connectivity, Distance, and Spanning Trees•Searching a Graph•Simple Applications of DFS and BFS•Minimum Spanning Tree•Shortest Paths•Eulerian and Hamiltonian ...