data structure
⚡️Data Structures-Chapter 1
⚡️Abstract Data Type Case
⚡️Data Structures-Chapter 2(1)-Linear Structures
⚡️Data Structures-Chapter 2(2)-Sequential Representation and Implementation of Linear Tables
⚡️Data Structures-Chapter 2 (3) - Sequence table (with code)
⚡️ Data structure - Chapter 2 (4) - Case of sequence table (with code)
⚡️ Data structure - Chapter 2 (5) - Chained storage structure
⚡️ Data structure - Chapter 2 (6) - Implementation of basic operations of singly linked list
⚡️ Data structure - Chapter 2 (7) - Doubly linked list and circular linked list
Data Structures - Chapter 4 Generalized Tables
Generalized table
Generalized list, also known as List ListLi s t is n > = 0 n >=0n>=A finite sequence of 0 elements, each of which can be any form of data.
A generalized table is usually written as LS = ( a 1 , a 2 , a 3 … , an ), where: LS is the table name, n is the length of the table, and each ai is an element of the table. LS = (a1, a2, a3...,an), where: LS is the table name, n is the length of the table, and each ai is an element of the table.LS=（A 1 ,a 2 ,a 3…,an）,Where : L S is the table name , n is the length of the table , and each a i is the element of the table .
-
Footer: A table consisting of other elements other than the header.
-
Denoted as tail(LS) = (a2,…,an)
-
Note: The end of the table is not the last element, but a sub-table
Properties of Generalized Tables
case
Summarize
I look forward to your communication with me, leave a message or private message, learn together and make progress together!