jThis book includedes a concise presentation of data structures such as AVL Trees, m-way search trees and B trees supplemented with solved problems and programming problems. A brief discussion on other notations of algorithm complexity, apart from O notation, has also been included. To demonstrate the implementation of data structures in a specific programming language, an appendix illustrating the implementation of a selective set of algorithms and procedures from the main text in the programming language C, has been added.
|Publisher:||Tata McGraw Hill Education|
|Number of Pages:||484|
* We sell only brand NEW book and do NOT sell old or used books.
* The book images and summary displayed may be of a different edition or binding of the same title.
* Price can change due to reprinting, price change by publisher or distributor.