| 000 | 01110cam a22002174a 4500 | ||
|---|---|---|---|
| 999 |
_c577 _d577 |
||
| 001 | 1876 | ||
| 005 | 20200703111016.0 | ||
| 008 | 000216s2000 enka 001 0 eng | ||
| 020 | _a9788129706829 | ||
| 040 | _cPK | ||
| 082 | 0 | 0 |
_a005.13/3 _221 _bB8857 |
| 100 | 1 | _aBrownsey, Ken. | |
| 245 | 1 | 4 |
_aThe essence of data structures using C++ / _cKen Brownsey. |
| 260 |
_aNew Delhi : _bPrentice Hall, _c2004 |
||
| 300 |
_axvi, 267 p. _bill. ; _c24 cm. |
||
| 500 | _aincludes index | ||
| 650 | 0 | _aC++ (Computer program language) | |
| 650 | 0 | _aData structures (Computer science) | |
| 942 | _cBK | ||
| 505 | 0 | _a Data, Types, Structures and References Abstract Data Types (1) ; A Draughts Board Example Abstract Data Types (2) ; Definitions, Container and Real World ADTs Abstract Data Types (3) ; Implementation of ADTs by Dynamic Data Structures The Stack ;A Linear ADT based on the Sequence Recursion The Binary Search Tree ; A Recursively Defined ADT Implementing BT_T, higher level operations, and re;implementation of BST_T Searching and Sorting Case Study (1) ; The GRAPH_T ADT Case Study (2) ; The Turing Machine | |