ABSTRACT

Combining knowledge with strategies, Data Structure Practice for Collegiate Programming Contests and Education presents the first comprehensive book on data structure in programming contests. This book is designed for training collegiate programming contest teams in the nuances of data structure and for helping college students in computer-related

chapter 1|26 pages

Practice for Simple Computing

chapter 2|16 pages

Simple Simulation

chapter 3|16 pages

Simple Recursion

chapter |2 pages

Summary of Section I

chapter 4|76 pages

Linear Lists Accessed Directly

chapter 6|20 pages

Generalized List Using Indexes

chapter 7|36 pages

Sort of Linear Lists

chapter |2 pages

Summary of Section II

chapter |2 pages

Section III: Experiments for Trees

chapter 8|50 pages

Programming by Tree Structure

chapter 9|14 pages

Applications of Binary Trees

chapter 10|38 pages

Applications of Classical Trees

chapter |2 pages

Summary of Section III

chapter |2 pages

Section IV: Experiments for Graphs

chapter 11|68 pages

Applications of Graph Traversal

chapter 12|18 pages

Algorithms of Minimum Spanning Trees

chapter 13|34 pages

Algorithms of Best Paths

chapter |2 pages

Summary of Section IV