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

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

In JavaScript, data structure refers to the collection of data elements that have one or more specific relationships with each other, and is a collection of data elements with structural characteristics. Common data structures are: arrays, lists, stacks, queues, linked lists, dictionaries, collections, and so on.

The operating environment of this tutorial: windows7 system, javascript1.8.5 version, Dell G3 computer.

What is a data structure?

In computer science, data structure (English: data structure) is the way that computers store and organize data. A data structure is a collection of data elements that have one or more specific relationships with each other. Data structure originated from programming, it is not how to learn how to code, but to provide us with a programming idea, with better ideas. In general, carefully selected data structures can lead to higher operational or storage efficiency. Data structures are often related to efficient retrieval algorithms and indexing techniques.

What can data structures do?

Effectively manage data objects

Improve computing performance

Conceptual definition of data structure

Data:

Data: a symbol used to describe an objective thing (string, number, json, sound, picture...) data element: the most basic unit with a certain meaning. When we use a computer to process data, the data element is usually processed by us as a whole, which is also called record data object: refers to the collection of data elements of the same nature: the smallest unit that makes up the data.

Structure:

The relationship between data elements is called structure.

There are two kinds of structures:

Logical structure: a data structure that reflects the logical relationship between data elements, which refers to the before-and-after relationship between data elements, regardless of their storage location in the computer.

Storage structure: the form in which the logical structure of data is stored in computer storage space.

Therefore, a data structure can be represented as one or more storage structures

Logical structure:

Set: the data members in the set are unordered and loose, and each data member cannot repeat the linear structure in the set: the elements in the data structure have an one-to-one interrelationship nonlinear structure: the elements in the data structure have an one-to-many or many-to-many relationship.

Storage structure:

Sequential storage: array is a typical sequential storage structure chain storage: linked list uses linked storage index storage: the advantage of index storage is fast retrieval, but it needs to add additional index tables. will take up more storage space hash storage: hash storage makes the operation of searching, adding and deleting nodes very fast, but the disadvantage is that solving hash conflicts will increase the cost of time and space. The common methods to solve hash conflicts are open chain method and linear detection method.

Common data structures

Array:

A linear set of storage elements (collection). Elements can be accessed arbitrarily by an index, which is usually a number and is used to calculate the offset of storage locations between elements.

List:

People often use lists in their daily lives: to-do lists, shopping lists, top ten lists, the last ten lists, and so on.

Stack:

Is an efficient data structure, because data can only be added or deleted at the top of the stack, so this operation is fast and easy to implement.

Queue:

Queues are used to store sequential data, first-in, first-out, unlike stacks

Linked list:

A linked list is a collection of nodes. Each node uses a reference to an object to point to its successor. A reference to another node is called a chain

Dictionary:

A dictionary is a data structure that stores data in the form of key-value pairs, just like names and phone numbers in a telephone directory.

Tree:

Tree is a kind of data structure often used in computer science. Tree is a non-linear data structure, which stores data in a hierarchical way.

Trees are used to store hierarchical data, such as files in the file system, and trees are used to store ordered lists.

Figure:

A graph consists of a set of edges and a set of vertices.

Hash table:

Hashing is a commonly used data storage technology, and the hashed data can be quickly inserted or accessed. The data structure used for hashing is called a hash table.

Collection:

A set is a data structure that contains different elements. The elements in the collection are called members.

The two most important features of a collection are: first, the members in the collection are unordered; second, the same members are not allowed to exist in the collection.

Common data structures will be broken one by one in the follow-up!

At this point, the study on "what is the JavaScript 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.