Data Structure of Information Olympiad

Brief introduction to the data structure resources of the Information Science Olympiad:

Course Outline

01-Stack Data Structure

02-Vector Data Structure

03-Queue data structure

04-Breadth-First Search

05-Basic concepts of trees and binary trees

06-Binary tree storage and traversal questions

07-Heap sort and priority queue

08-Huffman Tree

09-Basic concepts of graphs

10-Graph Storage

11-Depth-first and breadth-first traversal of a graph

12-Euler Road and Hamilton Ring

13-Depth-first shortest path

14-Floyd's shortest path algorithm

15-Dijkstra algorithm

16-Bellman-Ford Shortest Path Algorithm

17-SPFA shortest path algorithm

18-Graph Connectivity

19-Join and Find

20-Minimum spanning tree Prim algorithm