Data Structures
Unit - II
Linear List Concepts: Insertion, Deletion, Retrieval, Traversal
Linked List Algorithms: Create List, Insert Node, Delete Node, Search List, Unordered List Search, Retrieve Node, Empty List, Full List, List Count, Traverse List, Destroy List
Processing a Linked List: Add Node, Remove Node, Print List, Testing Insert and Delete Logic
Complex Linked List Structures: Circularly Linked Lists, Doubly Linked Lists, Multilinked Lists, Multilinked List Insert, Multilinked List Delete
Comments
Post a Comment