But only one view of the company is shown by the above list. You also want the database to represent the relationships between employees and management at ABC. It does not tell you which managers are responsible for which workers and so on, although your list contains both name and position. After thinking about the problem for a while. You decide that the tree diagram is much better structure for showing the work relationships at the ABC company.

These two above diagrams are examples of the different data structures. Your data is organized into a list, in one of the data structures which is above. The employees name can be stored in alphabetical order so that we can locate the employee's record very quickly. For showing the relationships between employees these structure is not very useful. The tree structure is a much better suited for this purpose.

The data structures are an important way of organizing information in a computers. There are many different data structures that programmers use to organize data in computers, just like the above illustrated diagrams. Some of the data structures are similar to the tree diagram because they are good for representing the relationships between different data. Other structures are good for ordering the data in a particular way like the list of employees which is shown above. Each data structure has their own unique properties that make it well suited to give a certain view of the data.

• Show how data structures are represented in the computer,
• Identify linear and nonlinear data structures,
• Manipulate data structures with basic operations, and
• Compare different implementations of the same data structure.