| 000 | 01130 m a2200205 44500 | ||
|---|---|---|---|
| 003 | XX-XxUND | ||
| 005 | 20230818092712.0 | ||
| 008 | s2005 xx |||||||||||| ||||und d | ||
| 020 | _a9780070601680 | ||
| 037 | _c$1.00 | ||
| 040 | 1 |
_aXX-XxUND _cXX-XxUND |
|
| 100 | 1 | _aLipschutz, Seymour | |
| 245 | 1 | _aData Structures | |
| 260 |
_aNew York : _bMcgraw Hill, _c©2005. |
||
| 300 | _a484 p. | ||
| 520 | _aThis book treats the Data Structure algorithms in a form that is machine and language independent. It adopts an elementary approach to the subject matter with many examples & diagrams and is suited to be of great assistance as a textbook or supplement for effective self-study. Features: Algorithms are presented in pseudocode. Highly illustrative with over 300 figures and 375 exercises. Discussion of Linked representation of Stacks and Queues. Detailed inclusion of new topics within Trees : AVL Search Trees, m-way Search Trees and B Trees. | ||
| 650 | _a Electronic data processing | ||
| 856 | 4 | 0 |
_uhttps://www.expresslibrary.mheducation.com/product/data-structures _zE-book |
| 942 |
_2ddc _cEBK |
||
| 999 |
_c2409 _d2409 |
||