back
教学课件
back
Although this list contains both name and position， it does not tell you which
managers are responsible for which workers and so on. If you want your
Queue
A collection of items in which only the earliest added item may be accessed. Basic operations are add （to the tail） or enqueue and delete （from the head） or dequeue. Delete returns the item removed. Also known as “first in， first out” or FIFO.
Stack
A collection of items in which only the most recently added item may be removed. The latest added item is at the top. Basic operations are push and pop. Often top and is Empty are available， too. Also known as “last in， first out” or LIFO.
database to represent the relationships between management and employees at
ABC， a tree diagram is a much better structure for showing the work
relationship at ABC.
教学课件 Much of programming involves the storage and retrieval of data. Many
of the most efficient aห้องสมุดไป่ตู้gorithms for important problems are based on the use of specific data structures； the efficiency of the algorithm depends on the efficiency of the underlying data structure.［2］ Software design often involves the choice of appropriate data structures.
There are many different data structures that programmers use to organize data in computers. Each data structure has certain operations that naturally fit with data structure. Often these operations are bundled with the data structure and together they are called a data type. An example
教学课件
back
These two diagrams are examples of different data structures. If you want to locate the employee's record very quickly， you can use the list that keeps the names of the employees in alphabetical order； If you want to see relationships between employees， the tree structure is much better.
教学课件 of several common data structures are arrays， linked lists， queues， stacks， binary trees， and
hash tables.
List
A collection of items accessible one after another beginning at the head and ending at the tail.
For example， imagine that you are asked to create a database of names with ABC company s management and employees. To start your work， you make a list of everyone in the company along with their position.
Tree
A data structure accessed beginning at the root node. Each node is either a leaf or an internal node. An internal node has one or more child nodes and is called the parent of its child nodes.［3］ All children of the same node are siblings. Contrary to a physical tree， the root is usually depicted at the top of the structure， and the leaves are depicted at the bottom.
Lesson 6 Data Structure
In computer science， the way information is organized in the memory of a computer is called a data structure.［1］ It’s a data type whose values are composed of component elements that are related by some structure.