Location:Training / Machine Learning/Algorithm / Data Structure Shanghai Jiao Tong University / Huffman tree and its applications, prefix coding, Huffman coding

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.