000			01558nam a22001577a 4500
008			230201b |||||||| |||| 00| 0 eng d
020			_a978-81-203-1177-0
082			_223 _a005.73 _bLAN
100			_aLangsam Yedidyah
245			_aData Structures Using C and C ++ _cYedidyah Langsam, Moshe J. Augustein, et.al _henglish
250			_a2nd ed _b1995
260			_aIndia _bPHI
300			_aiii-670 p. ; _bsoft bound _c17.5 *23.7 cm
505			_a Introduction to data structures Information and meaning Arrays in C Structures in C Classes in C++ The stack Definition and examples Representing stacks in C Example: Infix, postfix, and prefix Recursion Recursive definition and processes Recursion in C Writing recursive programs Simulating recursion Efficiency of recursion Queues and lists The queue and its sequential representation Linked lists Lists in C Example: Simulation using linked lists Other list structures The linked list in C++ Trees Binary trees Binary tree representations Example: The Huffman algorithm Representing lists as binary trees Trees and their applications Example: Game trees Sorting General background Exchange sorts Selection and tree sorting Insertion sorts Merge and radix sorts Searching Basic search techniques Tree searching General search trees Hashing Graphs and their applications Graphs A flow problem Linked representation of graphs Graph traversal and spanning forests Storage management General lists Automatic list management Dynamic memory management
942			_2ddc _cBK
999			_c7783 _d7783