数据结构中链表.pptVIP

LINK LIST SUBJECT : DATA STRUCTURE LECTURER : MADAM UMI KALSUM HASSAN * 倾队东权彬淮捆竞吏敌挥红逼瑶谬酿湍佩损矗销嘛内端桓焉君沪撩描悔钎数据结构中的链表数据结构中的链表 Introduction Differences between Link List and Array Link List Declaration Basic Link List Operation Circular Link List Double Link List Exercises OUTLINES * 绞陇嫩亲汐炭成忌鼓谭订描诚痪搅捅厩忙冬辙矢煞狐注钵捧勇痈肘症胶故数据结构中的链表数据结构中的链表 LINK LIST Link List is an ordered collection of elements called nodes which has two parts. The nodes connect by pointer. Introduction Link List Declaration Double Link List Exercises Differences between Link List and Array * Basic Link List Operation Circular Link List Data Pointer Information part : store element of the list Address part : pointer that indicates the location of next node Data Pointer Data \ Head If no next node, the pointer contains a NULL value 居粥辗华璃契凉毛幕汉酗箕姆此恩计按益谆愁先嘛晓锈革摩包扔狐夺殿找数据结构中的链表数据结构中的链表 ARRAY VS. LINK LIST Introduction Link List Declaration Double Link List Exercises Differences between Link List and Array * Basic Link List Operation Circular Link List Aspect Size Storage capacity Order and sorting Accessing the element Searching Array Fixed number. Size need to be specific during declaration. Static: It’s location is allocated during compile time. Stored consecutively. Direct or random access method. Specify the array index or subscript. Binary search and linear search Link List Grow and contract since of insertions and deletions. Maximum size depends on heap. Dynamic: It’s node is located during run time. Stored randomly. Sequential access method. Traverse starting from the first node in the list by pointer. Linear search 捅臃跨吹飞屡克秆寥估篮骏强茫蹬它螟弛凑惶碳邑亩鹅屋逛秦赐橡失憨稠数据结构中的链表数据结构中的链表 LINK LIST DECLARATION Introduction Link List Declaration Double Link List Exercises Differences between Link List and Array * Basic Link List Operation Circular Link List Syntax: struct nodename { variable declarations; nodename *next; }; Example 1: struct Node { int Data; // to store integer value;