Lecture 36 - Introduction to Linked List (മലയാളത്തിൽ) - Data Structures

Linked List can be defined as collection of objects called nodes that are randomly stored in the memory. Singly linked list can be defined as the collection of ordered set of elements. The number of elements may vary according to need of the program. A node in the singly linked list consist of two parts: data part and link part. Data part of the node stores actual information that is to be represented by the node while the link part of the node stores the address of its immediate successor.
• A node contains two fields i.e. data stored at that particular address and the pointer which contains the address of the next node in the memory.
• The last node of the list contains pointer to the null.

[@Kingkohli-j9x]

👍

[@safna366]

Super cls .thanq♥️

[@tutefox4921]

than you for your support, please share to friends and subscribe the channel

[@someanukunjjithing8803]

vere helpfull 🙏🥺 eniyum upload cheyne

[@reaperyt5844]

❣️adipoli class

[@albertsebastian6945]

🎉🎉adipoli

[@arjunambady8416]

❤

[@Ne.M.O]

Noice

[@Fujaisensei2002]

❤