Data Structures in Python

Data Structures in Python
(Last Updated On: 11/09/2023)

Data Structures in Python

In this blog, we’ll look at the most important Python data structures, how to utilize them efficiently, and when to use one over the other.

A data structure is a fundamental concept in computer science and programming. It refers to the organization, storage, and manipulation of data in a systematic way. Data structures provide efficient methods for accessing and managing data, allowing programmers to optimize algorithms and solve problems effectively.

Lists in Python

Lists are one of the most versatile and widely used data structures in Python. They are simply organized groupings of elements, and their versatility allows them to be used for a variety of purposes. Individual entries within a list are separated by commas and are defined by square brackets ‘[]’. A more detailed explanation of common list operations follows: 

1. Creating Lists: You can create a list by enclosing elements within square brackets. Lists can contain elements of different data types, including integers, strings, floats, and even other lists.

2. Indexing: Lists are indexed, which means you can access individual elements by their position (index) in the list. Python uses zero-based indexing, so the first element is at index 0, the second at index 1, and so on.

3. Slicing: Slicing allows you to extract a portion of a list by specifying a range of indices. It’s a powerful way to work with subsets of a list.

4. Appending: You can add elements to the end of a list using the `append()` method. This is useful for dynamically growing a list.

5. Modifying Elements: Lists are mutable, which means you can change the value of an element at a specific index.

6. Length: You can find the number of elements in a list using the `len()` function.

Now, let’s see an example of creating and working with a Python list:

# Creating a list of integers
numbers = [1, 2, 3, 4, 5]
# Accessing elements by index
first_number = numbers[0]  # Access the first element (1)
second_number = numbers[1]  # Access the second element (2)
# Slicing the list
subset = numbers[2:4]  # Creates a new list [3, 4] (index 2 to 3)
# Appending an element to the end of the list
numbers.append(6)  # Adds 6 to the end of the list
# Modifying an element
numbers[0] = 10  # Changes the first element to 10
# Finding the length of the list
list_length = len(numbers)  # Returns 6 (the number of elements in the list)
# Printing the updated list
print(numbers)  # Output: [10, 2, 3, 4, 5, 6]

In this example, we created a list called `numbers`, accessed elements by index, sliced the list, appended an element, modified an element, and found the length of the list. Lists are incredibly flexible and can be used in a wide range of programming scenarios.


In Python, tuples are an essential data structure that shares similarities with lists but has a crucial distinction: tuples are immutable. This immutability means that once you create a tuple, you cannot modify its elements. However, tuples are ordered, which means the order of elements within a tuple is preserved.

 Benefits of Tuples

Tuples offer several advantages:
– Immutability ensures data integrity.
– Tuples are often faster than lists for certain operations.
– They can be used as keys in dictionaries (due to their immutability).

Python Code Example

Here’s an example of creating and working with tuples in Python:

# Creating a tuple
point = (3, 5)
# Accessing elements
x = point[0]  # x is 3
y = point[1]  # y is 5
# Unpacking a tuple
x, y = point  # x is 3, y is 5
# Tuples as dictionary keys
coordinate = {(3, 5): "A point on a graph"}
# Iterating through a tuple
for value in point:
# Concatenating tuples
tuple1 = (1, 2)
tuple2 = (3, 4)
result = tuple1 + tuple2  # result is (1, 2, 3, 4)

In this example, we create a tuple `point` to represent 2D coordinates, access its elements, unpack it, and demonstrate other tuple operations. Tuples provide a lightweight and efficient way to work with fixed sets of data in Python.


In Python, sets are a versatile and efficient way to store collections of unique elements. Unlike lists or tuples, which allow duplicate values, sets enforce uniqueness, making them ideal for scenarios where you need to work with distinct items. Sets have no specific order, meaning that the elements are not stored in a predictable sequence.

Key Characteristics of Sets:

  • Uniqueness: Sets do not allow duplicate elements. If you attempt to add a duplicate element to a set, it will be ignored.
  • No Specific Order: Sets do not maintain the order of elements as they are added. The order of elements in a set can change over time.
  • Fast Lookups: Sets are highly optimized for fast membership testing, making them efficient for checking whether an element exists in a collection.

Creating Sets in Python:

You can create a set in Python using curly braces `{}` or the `set()` constructor. Here’s how you can define a set and add elements to it:

# Creating a set using curly braces
my_set = {1, 2, 3, 4, 5}
# Creating a set using the set() constructor
another_set = set([3, 4, 5, 6, 7])

Common Set Operations:

Sets support a variety of operations to work with elements. Some of the common operations include:

1. Adding Elements: You can add elements to a set using the `add()` method.


2. Removing Elements: To remove elements, you can use the `remove()` or `discard()` method. The key difference is that `remove()` raises an error if the element is not found, while `discard()` does not.


3. Checking Membership: You can check if an element is in a set using the `in` operator.

if 3 in my_set:
       print("3 is in the set")

4. Set Operations: Sets support set operations like union, intersection, difference, and symmetric difference. These operations are useful when working with multiple sets.

set1 = {1, 2, 3}
   set2 = {3, 4, 5}
   union_result = set1 | set2  # Union
   intersection_result = set1 & set2  # Intersection
   difference_result = set1 - set2  # Difference
   symmetric_difference_result = set1 ^ set2  # Symmetric Difference

Use Cases for Sets:

Sets are particularly useful in scenarios where you need to:

– Eliminate duplicate values from a collection.
– Check for the existence of a specific element.
– Perform set operations like union and intersection on datasets.
– Efficiently store and manage unique data, such as unique user IDs or distinct values in a dataset.

Now, let’s demonstrate a simple Python code example using sets:

# Creating a set of unique colors
colors = {"red", "green", "blue", "green", "yellow"}
# Adding a new color to the set
# Removing a color from the set
# Checking if a color exists in the set
if "blue" in colors:
   print("Blue is in the set")
# Printing the updated set
print("Updated set of colors:", colors)

In this example, we create a set of colors, add and remove elements, check for membership, and print the updated set. The set automatically eliminates duplicates and enforces uniqueness.

Sets are a valuable tool in Python for managing unique collections of data efficiently. Their simplicity and fast lookup capabilities make them a go-to choice in various programming scenarios.


Dictionaries in Python are versatile data structures that facilitate the organization and retrieval of data through key-value mapping. They are highly efficient for tasks that require fast lookups based on unique keys. In a dictionary, each key is associated with a value, and you can access values by specifying the corresponding key. Dictionaries are essential for solving various real-world problems efficiently.

Anatomy of a Dictionary

A dictionary is defined using curly braces `{}` or the built-in `dict()` constructor. Here’s the basic structure of a dictionary:

my_dict = {'key1': 'value1', 'key2': 'value2', 'key3': 'value3'}

In this example, `my_dict` is a dictionary with three key-value pairs. Keys and values can be of any data type, and keys must be unique within a dictionary.

Dictionary Operations
1. Accessing Values: To retrieve a value from a dictionary, you use its key enclosed in square brackets or the `get()` method. This is a highly efficient operation.

value = my_dict['key1']  # Retrieves 'value1'
   value = my_dict.get('key2')  # Retrieves 'value2'

2. Modifying Values: You can change the value associated with a key in a dictionary by simply assigning a new value to that key.

my_dict['key1'] = 'new_value'

3. Adding New Key-Value Pairs: To add a new key-value pair to a dictionary, assign a value to a key that doesn’t exist in the dictionary.

 my_dict['new_key'] = 'new_value'

4. Removing Key-Value Pairs: To delete a key-value pair, use the `del` statement or the `pop()` method.

 del my_dict['key2']  # Deletes the 'key2' entry
   value = my_dict.pop('key3')  # Deletes 'key3' and returns its value

5. Checking for Key Existence: You can check if a key exists in a dictionary using the `in` operator or the `get()` method.

  if 'key1' in my_dict:
       print('Key1 exists in the dictionary.')
   value = my_dict.get('key4', 'default_value')  # Safely get 'default_value' if 'key4' doesn't exist

Example: Using a Dictionary

Here’s a practical example of using a dictionary to store information about a person:

person = {
    'name': 'Alice',
    'age': 30,
    'city': 'New York'

print(person['name'])  # Output: 'Alice'
print(person['age'])   # Output: 30

person['occupation'] = 'Engineer'  # Adding a new key-value pair

if 'city' in person:
    print(f"{person['name']} lives in {person['city']}.")

del person['age']  # Removing 'age' from the dictionary

print(person)  # Output: {'name': 'Alice', 'city': 'New York', 'occupation': 'Engineer'}

In this example, we create a dictionary `person` to store information about an individual, access and modify the data, and demonstrate common dictionary operations. Dictionaries are essential tools for managing and organizing data in Python, particularly when you need to perform fast lookups by unique keys.

 Arrays (NumPy)

While Python provides lists as a versatile way to store and manipulate data, when it comes to numerical computations and working with large datasets, NumPy arrays take the spotlight. NumPy, short for “Numerical Python,” is a fundamental library in the Python ecosystem for scientific computing and data analysis. It introduces the concept of arrays, which are homogeneous collections of data, typically of the same data type.

Get complete Best Python Books for Programmers here!

Advantages of NumPy Arrays:

  • Efficiency: NumPy arrays are highly efficient, both in terms of memory usage and computational speed. They are implemented in C and optimized for performance.
  • Homogeneity: All elements in a NumPy array must be of the same data type, which makes operations faster and more predictable.
  • Broadcasting: NumPy allows for element-wise operations between arrays of different shapes, thanks to its broadcasting rules.
  • Vectorization: NumPy encourages vectorized operations, meaning you can apply operations to entire arrays instead of looping through individual elements. 

Example of Python Arrays (NumPy) Code

Let’s consider a simple example of creating and manipulating NumPy arrays:

import numpy as np
# Create a NumPy array from a Python list
my_array = np.array([1, 2, 3, 4, 5])
# Perform basic operations on the array
sum_of_elements = np.sum(my_array)
mean_value = np.mean(my_array)
squared_array = my_array ** 2
# Access elements using indexing
third_element = my_array[2]
# NumPy arrays support broadcasting
scaled_array = my_array * 2
# NumPy arrays can be multi-dimensional
matrix = np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]])
# Perform matrix operations
matrix_transpose = np.transpose(matrix)
matrix_product =, matrix_transpose)

Stacks and Queues in Python

Stacks and queues are essential abstract data types that help manage data in specific orders. They are commonly used in various computer science and software engineering applications. In Python, you can implement these data structures using built-in lists, but there are also specialized libraries like `queue` that provide more functionality.


A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle. In other words, the last element added to the stack is the first one to be removed. Think of it as a stack of books: you add books to the top of the stack and remove them from the top as well.

Example of a Stack in Python:

stack = []  # Create an empty stack using a list

# Push elements onto the stack

# Pop elements from the stack
top_element = stack.pop()  # Removes and returns 3

In this example, `append` is used to push elements onto the stack, and `pop` is used to remove the top element.


A queue is another linear data structure, but it follows the First-In-First-Out (FIFO) principle. Items are added at the back of the queue and removed from the front. Imagine it as a line of people waiting; the person who arrived first gets served first.

Example of a Queue in Python

from queue import Queue  # Import the Queue class from the queue module

queue = Queue()  # Create an empty queue

# Enqueue (add) elements to the queue

# Dequeue (remove) elements from the queue
front_element = queue.get()  # Removes and returns 1

In this example, we use the `Queue` class from the `queue` module to create a queue. We enqueue elements using the `put` method and dequeue elements using the `get` method.

Use Cases:

Stacks are commonly used for tasks like implementing function calls and managing recursive algorithms, tracking state changes in parsers, and undo functionality in software.

Queues are often used in scenarios such as task scheduling, breadth-first search algorithms, and managing resources with limited capacity (e.g., a printer’s job queue).

These data structures are foundational in computer science and have applications in various fields of programming. Understanding when and how to use them is essential for solving a wide range of problems efficiently.

Also, learn about Java Program to Remove Duplicate Elements in an Array, Now!

Linked Lists

Linked lists are dynamic data structures that consist of nodes, each containing data and a reference to the next node. They’re great for scenarios where you need efficient insertions and deletions.

Linked lists are a fundamental data structure used in computer science and programming. They offer an alternative to arrays and provide certain advantages in terms of dynamic memory allocation and efficient insertions and deletions. A linked list consists of a series of nodes, each containing data and a reference (or link) to the next node in the sequence. Unlike arrays, which store elements in contiguous memory locations, linked lists allow elements to be scattered in memory, making them ideal for scenarios where elements need to be inserted or removed frequently.

Key Characteristics of Linked Lists:

– Each node contains both data and a reference to the next node.

– The last node typically has a reference to `None`, indicating the end of the list.

– Linked lists can be singly linked (each node points to the next node) or doubly linked (each node points to both the next and previous nodes).

Advantages of Linked Lists:

– Dynamic size: Linked lists can grow or shrink in size as needed, unlike arrays with fixed sizes.

– Efficient insertions and deletions: Insertions and deletions can be performed with O(1) time complexity in many cases.

Example of a Singly Linked List in Python

class Node:
    def __init__(self, data): = data = None

class LinkedList:
    def __init__(self):
        self.head = None

    def append(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
        current = self.head
            current = = new_node

    def display(self):
        current = self.head
        while current:
            print(, end=" -> ")
            current =

# Creating a linked list
my_linked_list = LinkedList()

# Displaying the linked list

In this example, we define a `Node` class to represent individual elements in the linked list. Each `Node` has data and a reference (`next`) to the next node. The `LinkedList` class provides methods for appending data to the list and displaying its contents. The result of running this code would be:

1 -> 2 -> 3 -> None

This demonstrates a basic singly linked list with three elements. Linked lists are versatile and can be extended to include various operations like insertions, deletions, and searches, making them essential data structures for many programming tasks.

Trees and Graphs

Trees and graphs are fundamental data structures used for organizing and representing hierarchical and connected data. They have wide-ranging applications in computer science and real-world problem-solving.


A  tree is a hierarchical data structure consisting of nodes connected by edges. It has a root node at the top and branches downward, forming a tree-like structure. Each node can have zero or more child nodes. The key characteristic of trees is that there are no cycles (i.e., no circular references) within the structure.

Common types of trees include:

– Binary Tree: Each node has at most two children, a left child and a right child.

– Binary Search Tree (BST):  A binary tree with the property that for each node, all nodes in its left subtree have values less than the node’s value, and all nodes in its right subtree have values greater.

– Balanced Tree: A tree where the depth of the left and right subtrees of every node differs by at most one, ensuring efficient searching and insertion operations.


A graph is a collection of nodes (vertices) and edges (connections) between these nodes. Unlike trees, graphs can contain cycles, making them more flexible in representing complex relationships. Graphs can be used to model various real-world scenarios, such as social networks, transportation networks, and more.

Examples of Trees and Graphs:

Binary Tree:

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

# Creating a binary tree
root = TreeNode(1)
root.left = TreeNode(2)
root.right = TreeNode(3)
root.left.left = TreeNode(4)
root.left.right = TreeNode(5)

Binary Search Tree (BST):

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

# Creating a Binary Search Tree
root = TreeNode(10)
root.left = TreeNode(5)
root.right = TreeNode(15)
root.left.left = TreeNode(2)
root.left.right = TreeNode(7)


# Using dictionaries to represent a graph
graph = {
    'A': ['B', 'C'],
    'B': ['A', 'D', 'E'],
    'C': ['A', 'F'],
    'D': ['B'],
    'E': ['B', 'F'],
    'F': ['C', 'E']

Get Complete Python Interview Questions and Answers, here!

In this example, ‘A’, ‘B’, ‘C’, ‘D’, ‘E’, and ‘F’ represent nodes in the graph, and the edges between them are represented as lists of adjacent nodes. This simple graph represents connections between nodes in a network.

Trees and graphs are powerful data structures with numerous applications in computer science, such as in algorithms for searching, sorting, pathfinding, and data modeling. Understanding how to work with these structures is essential for tackling a wide range of programming challenges.

Advanced-Data Structures (Optional)

While Python offers a robust set of built-in data structures, there are situations where specialized data structures are needed to optimize specific tasks. In these cases, you can turn to more advanced data structures. Here, we’ll explore some advanced data structures that go beyond the basics.


A heap is a tree-based data structure that satisfies the heap property. Heaps are commonly used for tasks that require fast access to the minimum or maximum element. In Python, you can use the `heapq` module to work with heaps.

Hash Tables (Dictionaries)

While dictionaries are a fundamental data structure in Python, they are worth mentioning as an advanced structure due to their flexibility and underlying hash table implementation. Dictionaries offer constant-time average lookup, insertion, and deletion operations.

Trie (Prefix Tree)

A trie efficiently stores a dynamic set of strings and is a tree-like data structure. Tries are particularly useful for tasks like autocompleting and spell-checking.

Python’s diverse set of data structures empowers developers to tackle a wide range of programming challenges. Understanding when and how to use each data structure is a valuable skill for any programmer. Continuously explore and practice these structures to enhance your programming repertoire and become a more proficient Python developer.

We hope that our blog on ‘Data Structures in Python’ was informative and beneficial in the journey of learning Python programming. As you continue to develop your coding skills, visit Newtum’s website to learn more about our online coding courses in Java, Python, PHP, and other topics. Happy coding!


What is the role of data structures in Python programming?

Data structures in Python help organize, store, and manipulate data efficiently, enabling programmers to optimize algorithms and solve problems effectively.

How does a tuple differ from a list in Python?

Tuples are similar to lists but are immutable, meaning their elements cannot be changed after creation. Lists are mutable.

What is NumPy, and how does it enhance array handling in Python?

NumPy is a library in Python that provides efficient arrays for numerical computations. It enhances array handling with powerful mathematical operations and optimizations.

When should I use a heap data structure in Python?

You should use a heap when you need fast access to the minimum or maximum element in a collection. Heaps are commonly used for priority queues and scheduling.

What is the primary advantage of using a trie (prefix tree) in Python?

Tries are efficient for storing and searching large sets of strings, making them ideal for tasks like autocomplete, spell-checking, and dictionary implementations.

Leave a Reply

Your email address will not be published. Required fields are marked *