## Real question 872 of computer postgraduate entrance examination of Soochow University in 2021 -- data structure

Qi Guanjie 2021-01-05 17:24:23
real question postgraduate entrance examination

## 2021 Suzhou University Computer postgraduate entrance examination professional course 872 The real question — Data structure part

2021 Suzhou University Computer postgraduate entrance examination professional course 872 The real question — Data structure part

Hello everyone , My name is Qi Guanjie （qí guān jié ）, stay CSDN Record the process of learning , Time flies , Future period , come on. ~ Bloggers are only in CSDN Chinese blog , The only blog update address is ： Qi Guanjie's blog

This article was originally written by Qi Guanjie , Please support the original , Some platforms have been stealing blog articles maliciously ！！！
This article is Suzhou University Computer postgraduate entrance examination professional course 872 Column content , To subscribe to , You can view articles ： About Suzhou University Computer 872 Postgraduate entrance examination information column description and use details If you need further communication or one-to-one service for this column , You can contact me on wechat ：qiguanjie2015

## One 、 Data structure part

### 1. choice question .

Multiple choice questions are really hard to recall the specific topic data , Just write down the investigation points of each question here .

1. After the tree is transformed into a binary tree , The relationship between nodes .
2. Unordered list , And you need to sort it steadily , Make a selection ： Quick line up 、 Merger 、 Simple choice 、 Insertion sort
3. Dijkstra Find the shortest path
4. Binary tree ： Parents are no bigger than children , The left child is no bigger than the right child , Seek to use 1-n How many forms are there ,n take 1,2,3,4 when
5. How to judge the balance of a balanced binary tree after it is inserted into a node

### 2. Judgment questions

1. Suffix expressions need stacks to store operators .
2. The height is h There are at most 2 Of h-1 To the power of a leaf node
3. The degree of the last node in topological sorting must be 0
4. n A vertex undirected graph , The edge just loops , Then there are n－1 Spanning trees

## 5. Calculate the path length of the binary tree , The sum of the lengths of the nodes to each .

https://javamana.com/2020/12/20201231212023794J.html