Description: This document is a chm format, a set of data structures Kaoyan questions, divided into 11 chapters: Introduction, linear tables, stacks and queues, strings, arrays and broad tables, trees and binary trees, figure, dynamic storage management, a total ofcollection, sorting, file a total of 11 chapters. The most critical is the outside in addition to answer some brief analysis and interpretation.
To Search:
File list (Check if you may need any files):
数据结构考研试题.chm
Download