Data Structure Shanghai Jiao Tong University

A data structure refers to a collection of data elements that have one or more specific relationships with each other. Under normal circumstances, carefully selected data structures can bring higher operating or storage efficiency. Data structures are often related to efficient retrieval algorithms and indexing technologies. This tutorial is from the shallower to the deeper and is super detailed. It is suitable for self-study, classroom teaching and after-class review and examination. Shanghai Jiao Tong University's algorithm and data structure video tutorial is taught by teacher Tan Xiaohong. Basically, no key points and difficulties are missed. The main contents of this course include: basic concepts related to data structure, basic operations and applications of linear tables, and the definition and application of stacks and queues. Basic operations, string pattern matching algorithms, basic concepts and algorithm implementations related to binary trees, graph storage structures and algorithms, and various search and sorting algorithms, etc.

• Chapter 1：Definition of data structure, basic terms, algorithm time and space complexity (1 hours and 8 minutes and 55 seconds)

• Chapter 2：Type definition, implementation, basic operations and applications of linear tables (1 hours and 9 minutes and 51 seconds)

• Chapter 3：Definition and basic operations of linear lists, linear linked lists (49 minutes and 11 seconds)

• Chapter 4：Single linked list, circular linked list, two-way circular linked list (1 hours and 33 minutes and 56 seconds)

• Chapter 5：Definition, representation and implementation of stack, push and pop operations (1 hours and 8 minutes and 0 seconds)

• Chapter 6：Numeric conversion, bracket matching, expression evaluation (56 minutes and 27 seconds)

• Chapter 7：The structure, operation, and enqueuing and dequeuing algorithms of circular queues (1 hours and 11 minutes and 53 seconds)

• Chapter 8：Linked list merging, singly linked list inversion (1 hours and 7 minutes and 16 seconds)

• Chapter 9：Stack input and output, palindrome numbers, queue operations (1 hours and 2 minutes and 47 seconds)

• Chapter 10：Circular queue, double-ended circular queue, two-way stack, string (1 hours and 9 minutes and 56 seconds)

• Chapter 11：String pattern matching algorithms, tree definitions and basic terminology (1 hours and 11 minutes and 51 seconds)

• Chapter 12：Properties of binary trees, full binary trees, complete binary trees, binary linked lists (1 hours and 13 minutes and 14 seconds)

• Chapter 13：Recursive and non-recursive algorithms for binary tree traversal (1 hours and 3 minutes and 18 seconds)

• Chapter 14：In-order clue binary tree, in-order, two-way clue linked list (1 hours and 21 minutes and 14 seconds)

• Chapter 15：Hierarchical traversal of binary trees, complete binary trees, and binary linked lists (1 hours and 8 minutes and 42 seconds)

• Chapter 16：Representation of trees, conversion between forests and binary trees, and traversal (1 hours and 13 minutes and 2 seconds)

• Chapter 17：Huffman tree and its applications, prefix coding, Huffman coding (1 hours and 11 minutes and 35 seconds)

• Chapter 18：The construction process of Huffman tree, Huffman coding algorithm, and message decoding (1 hours and 17 minutes and 32 seconds)

• Chapter 19：Graph, vertex, arc, directed graph, undirected graph, complete graph, connected graph (57 minutes and 42 seconds)

• Chapter 20：Adjacency matrix, adjacency list, cross linked list, adjacency multiple list (1 hours and 13 minutes and 6 seconds)

• Chapter 21：Graph traversal, connected components, minimum spanning tree, Prim algorithm (1 hours and 7 minutes and 56 seconds)

• Chapter 22：Kruskal algorithm, topological sorting, critical path, dijksra algorithm (1 hours and 13 minutes and 23 seconds)

• Chapter 23：Ordered table search, binary search, index sequence table search (1 hours and 19 minutes and 2 seconds)

• Chapter 24：Binary sort tree, B+ tree, B-tree, hash table (1 hours and 6 minutes and 49 seconds)

• Chapter 25：Direct insertion sort, half insertion sort, Hill sort (58 minutes and 59 seconds)

• Chapter 26：Quick sort, selection sort, heap sort, merge sort, radix sort (1 hours and 22 minutes and 10 seconds)

• Chapter 27：Circular linked list, linked stack, circular queue, doubly linked list (1 hours and 14 minutes and 31 seconds)

• Chapter 28：Reverse, search and sorting of singly linked lists, determination and adjustment of heaps (49 minutes and 5 seconds)

• Chapter 29：Conversion of trees and binary trees, adjacency list of undirected graph, adjacency matrix representation (1 hours and 38 minutes and 57 seconds)