Basic data structures and algorithms

1. Basic Data Structure

The basic data structures include:

• Array. Sequential storage, which can be accessed randomly. With the fastest query speed, it is very troublesome to insert or delete elements.
• Linked List. Storage location, which can be accessed by node in sequence. Slow query, fast insertion and deletion of nodes. One-way linked list and two-way linked list.
• Block linked list. Array and linked list.
• Stack and queue.
• Tree. There are binary trees, plain trees, and B trees.
• Heap. Ordered Tree.
• Hash list. Hash table, that is, map.
• Graph.

2 Basic Algorithms

• Greedy Algorithm.
• The splitting algorithm.
• Dynamic Planning.
• Randomization algorithm.
• Backtracking Method.