Shulou(Shulou.com)06/02 Report--

This article mainly introduces "what are the interview questions of the web front-end data structure". In the daily operation, I believe that many people have doubts about the interview questions of the web front-end data structure. The editor consulted all kinds of materials and sorted out simple and easy-to-use methods of operation. I hope it will be helpful to answer the questions of "what are the interview questions of the web front-end data structure?" Next, please follow the editor to study!

I. basic data structure

1. The definition of the array

Answer: array is the most basic data structure, and many languages support arrays built into it. An array uses a continuous piece of memory space to store data, and the number of saved data is determined when memory is allocated.

2. Definition of linked list

Answer: the stored data can be continuous or discontinuous in the address space. Each node in the linked list includes data and a pointer to the next address. The time complexity of finding data is O (n), which facilitates the addition and deletion of data.

3. Definition of stack

Answer: the stack is a first-in-first-out logical structure, with each new element added and taken away at the top.

4. Definition of column

Answer: the column is a first-in-first-out logical structure, the operation of the element is at the beginning of the line and the end of the line, the element is inserted at the end of the line, and the element is deleted at the head of the line.

5. Binary tree

Answer: each node has at most two subtrees, and there are pointers to the left and right subtrees in the parent node. Preorder traversal of binary tree: root-left-right. Traversal in the middle order: left-root-right. Traversal after order: left-right-root.

Second, sorting algorithm

1. What are the commonly used sorting algorithms?

Answer: as shown in the following picture

2. Describe the principle of bubble sorting.

Answer: S1: start from the starting position of the sequence to be sorted, compare the size of each position and the one after it, and execute S2. S2: if the value of the current position is greater than the value of the subsequent position, exchange their values (after a full sequence comparison, the value of the last position of the sequence is the maximum value of the sequence, so it no longer needs to participate in bubbling). S3: removes the last position of the sequence from the sequence to be sorted. If the sequence to be sorted after removal is not empty, continue to execute S1, otherwise bubbling ends.

3. Fibolacher series

The main contents of this paper are as follows: 1. Describe the realization methods of several Fibonacci series.

Answer:

At this point, the study of "what are the interview questions of web front-end data structure" is over. I hope to be able to solve your doubts. The collocation of theory and practice can better help you learn, go and try it! If you want to continue to learn more related knowledge, please continue to follow the website, the editor will continue to work hard to bring you more practical articles!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.