* Different kinds of data structures are suited to different kinds of
applications, and some are highly specialized to specific tasks.
* For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.
Download Link :
http://www.ziddu.com/download/5474045/c.and.data.structures.ebook.rar.html
* For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.
Download Link :
http://www.ziddu.com/download/5474045/c.and.data.structures.ebook.rar.html
No comments:
Post a Comment