本书系统全面地介绍了数据结构算法与应用的概念和基本机理内容丰富，深入浅出。每章后面都有练习题便于读者学习，本书是一本学习数据结构，算法与应用的优秀速成指南。

PART 1 PRELIMINARIES

CHAPTER1 PROGRAMMING IN C++

CHAPTER2 PROGRAM PERFORMANCE

CHAPTER3 DATA REPRESENTATION

CHAPTER4 ARRAYS AND MATRICES

CHAPTER5 STACKS 239

CHAPTER6 QUEUES 283

CHAPTER7 SKIP LISTS AND HASHING

CHAPTER8 BINARY AND OTHER TREES

CHAPTER9 PRIORITY QUEUES

CHAPTER10 TOURNAMENT TREES

CHAPTER11 SEARCH TREES

CHAPTER12 GRAPHS 555

CHAPTER13 THE GREEDY METHOD 615

CHAPTER14 DIVIDE AND CONQUER

CHAPTER15 DYNAMIC PROGRAMMING

CHAPTER16 BACKTRACKING

CHAPTER17 BRANCH AND BOUND

INDEX 817

We can often rdeuce the disk storage needed to store a text file by storing a coded version of the file.For example,a text file that is a string of 1000xs followed by a sting of 2000ys will take 3002bytes of space(1 byte for eacd x and y,and 2 bytes to denote the string end)when stored as an uncoded text file.