Download our e-book of Introduction To Python

#### Machine Learning with Python & Statistics

4 (4,001 Ratings)

220 Learners

More webinars

Neha Kumawat

a year ago

## Data Structure Overview

Data structures are fundamental concepts of computer science which helps is writing efficient programs in any language. Python is a high-level, interpreted, interactive and object-oriented scripting language using which we can study the fundamentals of data structure in a simpler way as compared to other programming languages.
In this chapter we are going to study a short overview of some frequently used data structures in general and how they are related to some specific python data types. There are also some data structures specific to python which is listed as another category.

### General Data Structures

The various data structures in computer science are divided broadly into two categories shown below. We will discuss about each of the below data structures in detail in subsequent chapters.
These are the data structures which store the data elements in a sequential manner.
• Array: It is a sequential arrangement of data elements paired with the index of the data element.
• Linked List: Each data element contains a link to another element along with the data present in it.
• Stack: It is a data structure which follows only to specific order of operation. LIFO(last in First Out) or FILO(First in Last Out).
• Queue: It is similar to Stack but the order of operation is only FIFO(First In First Out).
• Matrix: It is two dimensional data structure in which the data element is referred by a pair of indices.
• Linked List: Each data element contains a link to another element along with the data present in it.
• Stack: It is a data structure which follows only to specific order of operation. LIFO(last in First Out) or FILO(First in Last Out).
• Queue: It is similar to Stack but the order of operation is only FIFO(First In First Out).
• Matrix: It is two dimensional data structure in which the data element is referred by a pair of indices.
• Stack: It is a data structure which follows only to specific order of operation. LIFO(last in First Out) or FILO(First in Last Out).
• Queue: It is similar to Stack but the order of operation is only FIFO(First In First Out).
• Matrix: It is two dimensional data structure in which the data element is referred by a pair of indices.
• Queue: It is similar to Stack but the order of operation is only FIFO(First In First Out).
• Matrix: It is two dimensional data structure in which the data element is referred by a pair of indices.
• Matrix: It is two dimensional data structure in which the data element is referred by a pair of indices.
These are the data structures in which there is no sequential linking of data elements. Any pair or group of data elements can be linked to each other and can be accessed without a strict sequence.
• Binary Tree: It is a data structure where each data element can be connected to maximum two other data elements and it starts with a root node.
• Heap: It is a special case of Tree data structure where the data in the parent node is either strictly greater than/ equal to the child nodes or strictly less than it’s child nodes.
• Hash Table: It is a data structure which is made of arrays associated with each other using a hash function. It retrieves values using keys rather than index from a data element.
• Graph: .It is an arrangement of vertices and nodes where some of the nodes are connected to each other through links.
• Heap: It is a special case of Tree data structure where the data in the parent node is either strictly greater than/ equal to the child nodes or strictly less than it’s child nodes.
• Hash Table: It is a data structure which is made of arrays associated with each other using a hash function. It retrieves values using keys rather than index from a data element.
• Graph: .It is an arrangement of vertices and nodes where some of the nodes are connected to each other through links.
• Hash Table: It is a data structure which is made of arrays associated with each other using a hash function. It retrieves values using keys rather than index from a data element.
• Graph: .It is an arrangement of vertices and nodes where some of the nodes are connected to each other through links.
• Graph: .It is an arrangement of vertices and nodes where some of the nodes are connected to each other through links.
These data structures are specific to python language and they give greater flexibility in storing different types of data and faster processing in python environment.
• List: It is similar to array with the exception that the data elements can be of different data types. You can have both numeric and string data in a python list.
• Tuple: Tuples are similar to lists but they are immutable which means the values in a tuple cannot be modified they can only be read.
• Dictionary: The dictionary contains Key-value pairs as its data elements.
• Tuple: Tuples are similar to lists but they are immutable which means the values in a tuple cannot be modified they can only be read.
• Dictionary: The dictionary contains Key-value pairs as its data elements.
• Dictionary: The dictionary contains Key-value pairs as its data elements.
In the next chapters we are going to learn the details of how each of these data structures can be implemented using Python.

#### Submit Review

BOT
Agent(Online)
We're Online!

Chat now for any query