509Ĩ.3.2 Analysis of Directory Dynamic Hashing. 509Ĩ.3.1 Dynamic Hashing Using Directories. 508Ĩ.2.5 Theoretical Evaluation of Overflow Techniques 508Ĩ.3 Dynamic Hashing.
446ħ.12 References and Selected Readings. 300Ħ.5.2 Activity on Edge (AOE) Networks. 300Ħ.5.1 Activity on Vertex (AOV) Networks. 280Ħ.4 Shortest Paths and Transitive Closure. 273Ħ.2.4 Biconnected Components, Articulation Points 274Ħ.3 Minimum Cost Spanning Trees. 245ĥ.11 References and Selected Readings. 234ĥ.8.1 Transforming a Forest into a Binary Search Tree 234ĥ.8.2 Forest Traversals. 228ĥ.7.3 Inserting an Element into a Binary Search Tree 229ĥ.7.4 Deleting an Element from a Binary Search Tree 230ĥ.7.5 Height of a Binary Search Tree. 200ĥ.4 Additional Binary Tree Operations. 162Ĥ.5.2 Operations for Doubly Linked Lists. 162Ĥ.5.1 Operations for Singly Linked Lists. 155Ĥ.4.4 Polynomials as Circularly Linked Lists. 150Ĥ.4.1 Representing Polynomials as Singly Linked Lists 150Ĥ.4.2 Adding Polynomials.
Reference Books: An Introduction to Data Structures. 138Ĥ.3 Dynamically Linked Stacks and Queues. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, Fundamentals of Data Structure in C, W.H.Freeman. 136Ĥ.1.2 Using Dynamically Allocated Storage. 89Ģ.6.1 Internal Implementation of Structures 90Ģ.6.1 Self-Referential Structures. 65Ģ.4 The Representation of Multidimensional Arrays. 51Ģ.3 The Sparse Matrix Abstract Data Type. 47Ģ.1 The Array as an Abstract Data Type. Contents may have variations from the printed book or be incomplete or contain other coding. Note: Contents data are machine generated based on pre-publication provided by the publisher. Table of contents for Fundamentals of data structures in C Table of contents for Fundamentals of data structures in C / Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed.īibliographic record and links to related information available from the Library of Congress catalog.
0 kommentar(er)
