Bo2SS

Bo2SS

HomeArchives

Summary of "Advanced Data Structures" Notes

#计算机#编程算法#海贼班#笔记专辑19
AI Translation
This post is translated from Chinese into English through AI.View Original
AI-generated summary
This is a summary of the "Advanced Data Structures" note compilation. It includes topics such as binary search trees, AVL trees, red-black trees, Huffman trees and coding, string matching algorithms, and more. The note compilation is curated by a person named "光哥" and they welcome feedback and guidance.

Summary of "Advanced Data Structures" Notes#

Steering: Guang Ge

Portal#

  1. Binary Search Tree, AVL Tree
  2. Red-Black Tree
  3. Huffman Tree and Huffman Coding
  4. String Matching Algorithms (Part 1): BF, KMP, SUNDAY, SHIFT-AND, Hash
  5. String Matching Algorithms (Part 2): Trie, AC, DAT

Please provide more guidance if you have any questions!#

Loading...
Ownership of this post data is guaranteed by blockchain and smart contracts to the creator alone.