About this document

ESc101 Lecture 27: Linked Lists Overview by Mukesh Kumar Dewra is a document available to read on EtoBox.

This document contains a lecture summary on linked lists from a fundamentals of computing course at IIT Kanpur in 2011. The lecturer begins by recapping self-referential structures and linked lists. Key points include that linked lists are dynamic data structures that allow flexible insertion and deletion by rearranging links, though searching is not efficient. The three major linked list operations - insertion, deletion, and searching - are discussed. Examples are then provided for creating the first node

Author

Mukesh Kumar Dewra

Language

EN