Data Structure

Data Structure is a term where a computer system organizes, manages, and stores data in the memory to help achieve efficient modification and access. An example of data structure is an Array, where elements are stored in sequential order, allowing easy and efficient retrieval of each element’s values.

Many developers confuse Data Structure with a programming language. A data structure is nothing but a system of how data is organized and not a programming language. However, a data structure can be implemented in many languages, such as C, C++, Python, C#, etc.

Data Structure Characteristics

[adinserter block=”2″]

The main characteristics of Data Structures that each program should be familiar with are:

  • Linear and non-Linear Data Structure: Data is arranged in sequences(Linear), such as Arrays, or unordered elements(non-Linear), such as Graphs.
  • Homogeneous or non-homogeneous Data Structure: Data in a given structure are of the same Data Type (Homogeneous ) or different data types(non-homogeneous)
  • Static or dynamic Data Structure: Data have fixed size( static) or expended/shrank size( Dynamic)

We will go through examples of data Structures that represent each characteristic later in this course.

Data Structure Types

  • Arrays
  • Linked lists
  • Stacks
  • Queues
  • Hash tables
  • Trees
  • Graphs
  • Tries

Each one of these types will be discussed in detail later in this course.

[adinserter block=”2″]


Data Structure - Arrays


Data Structure - Linked List