problem
What is the data structure
answer
Plus program is the data structure algorithms, data structures, good, elegant algorithm allows efficient and robust program allows stable. Data structure is the presence of one or more data elements of the particular relationship between each set, i.e., data organization and data. Common data structure are the following:
- Array (the Array)
array is a data type of polymerization, which is a number of variables having the same type of tissue together orderly set. The array can be said that the basic data structure has a corresponding In various programming languages. An array can be decomposed into a plurality of array elements, according to the type of data elements, the array can be divided into an array of integers, character arrays, floating point arrays, an array pointer array structure and the like. Arrays can also have a form of one-dimensional, two-dimensional and multi-dimensional and so on. - Stack (Stack)
A stack is a special kind of linear form, it only insertion and deletion of data in a node of the fixed end of a table. Stack according to the principle LIFO to store data, i.e., data will be inserted first onto the stack bottom, the last inserted in the stack, reading data, read out one by one beginning from the top of the stack. Stack assembly language program, often used to protect critical data in the field. When there is no data stack, called empty stack. - Queue (Queue)
queue stack and the like, is a special linear form. And stack difference is that only allows insertion queue at one end of the table, and a delete operation on the other end. Generally, one end of the insertion end of the operation is referred to as the tail, delete operation is referred to as the first team. When there is no queue element, called an empty queue. - List (Linked List)
linked list data element is a data structure stored in storage structure according to the chain, the presence of such a memory structure having a non-continuous physical characteristics. Chain consists of a series of data nodes, each node comprising a data part of the data field and two pointer fields. Wherein the pointer field contains the address of the next element in the data structure stored. Logical order of the linked list data structure element is realized by a pointer in the linked list order. - Tree (Tree)
tree is a typical nonlinear structure, it comprises two nodes of a finite set of K. In the tree structure, and only a root node, the node without predecessor node. Other nodes in the tree structure has nodes and only one precursor, and may have two successor nodes, m≥0.
Common concepts are: binary tree, balanced binary tree, red-black tree, B tree, B- tree, B + tree, the Huffman tree, ordered tree, unordered tree, binary tree, etc. full binary
common operations are: in the order of the tree , preamble, postorder, add, delete, sort, conversion, etc. - FIG. (Graph)
FIG another non-linear data structure. In view of the structure, the data is generally referred to as a vertex node, and the edges are ordered pairs of vertices coupling pair. If there is an edge between two vertices, it means that these two vertices having adjacent relationship.
Common concepts are: adjacency matrix, the adjacency list, against the adjacent table, orthogonal list, directed graph, an undirected graph simple graph, complete graph, subgraph, communication, communicating FIG, connected components, strongly connected graph, strongly connected components, forest, of the vertices, and the degree of penetration, and the right side of the web path, and the return path length, the path is simple, simple circuit, distance, minimum spanning tree, shortest path other
common operations include: graph traversal, conversion, add, delete, find the shortest path, etc. - Heap (Heap)
stack is a particular tree data structure, it is discussed in general stack binary heap. Stack is characterized by a value of the root node of all nodes in the minimum or maximum, and the root of the tree is a two sub-stack structure. - Hash table (the Hash)
hash is derived from a hash function (Hash function), and the key idea is that if T is equal to the record exists in the structure, then there must in F (T) storage locations can be found in the record, so it can not directly compare the operation to obtain the search records.
