Data Structure tutorial (C language)-(0)

Lesson 1: Basic concepts and terms of Data Structure
Lesson 2: representation and implementation of abstract data types
Lesson 3: algorithm and algorithm design requirements
Lesson 4: algorithm efficiency measurement and storage space requirements
Lesson 5: Linear table Type Definition
Lesson 6: Sequential Representation and implementation of linear tables
Lesson 7: Experiment 1 sequential storage of linear tables
Lesson 8: chained representation and implementation of linear tables
Lesson 9: Circular and bidirectional linked lists
Lesson 10: Stack representation and implementation
Lesson 11th: Stack Application
Lesson 12th: Experiment Two-cycle linked list Experiment
Lesson 13th: queue
Lesson 14th: Definition of strings
Lesson 15th: expression and implementation of strings
Lesson 16th: application example of string operations
Lesson 3: Experiment 3: Stack presentation and implementation and stack Application
Lesson 18th: sequential expression and implementation of Arrays
Lesson 19th: Implementation of Experiment 4 Series
Lesson 20th: generalized table
Lesson 21st: Tree and binary tree definition and terminology
Lesson 22nd: Experiment 5 array Experiment
Lesson 23rd: Binary Tree Storage Structure
Lesson 24th: traverse Binary Trees
Lesson 2: unit test
Lesson 26th: Graph definition and terminology
Lesson 27th: Experiment with six Binary Trees
Lesson 28th: Graph Storage Structure
Lesson 29th: static query table (1) sequential table search
Lesson 30th: static query table (2) query of ordered tables
Lesson 31st: Dynamic table search
Lesson 32nd: hash table (1)
Lesson 2: Hash Table (2)
Lesson 34th: insert sorting and quick sorting
Lesson 35th: Search for lab 7
Lesson 36th: Select sorting and Merge Sorting
Lesson 37th: Experiment 8 sorting Experiment
Lesson 38th: Document concept and sequence document
Lesson 39th: index files
Lesson 1: General Review