• Articles
  • Tutorials
  • Interview Questions
  • Webinars

Data Structures with Python Cheat Sheet

Tutorial Playlist

Introduction:

Data Structure is a collection of data types and set of rules with a format of organizing, managing and storage which can be used for efficient accessing and modification. Data structures are used in every field for storing and organizing data in the computer.

 

You can also download the printable PDF of this Data Structure cheat sheet

Data Structures Cheat Sheet

 

This Python Data Structure cheat sheet will help you understand what Data Structure is and the basic concepts and commands you must know to get started with it.

 

Further, if you want to learn Python Data Structure in-depth, you can refer to the tutorial blog on Python.

 

Data Structure: It is a way of organizing data that contains the items stored and their relationship to each other

DATA STRUCTURES with PythonThe areas in which Data Structures are applied:

  • Compiler design
  • Operating system
  • Database Management System
  • Statistical Analysis Package
  • Numerical Analysis
  • Graphics
  • Artificial Intelligence
  • Simulations

Data structures used in the following areas:

  • RDBMS: Array (Array of structure)
  • Network data model: Graph
  • Hierarchical Data model: Trees

Enhance your Python knowledge and become a python expert. Enroll in our Python Course Online and kick-start your career.

Types of Data Structures:

Primitive Data Structures:

  • Integer: It is used to represent numeric data, more specifically whole numbers from negative infinity to infinity

Example: 4, 5, -1 etc

  • Float: It stands for floating-point number

Example: 1.1,2.3,9.3 etc.

  • String: It is a collection of Alphabets, words, or other characters. In python String can be created by using a pair of single or double quotes for the sequence

Example:

x = ‘Cake’

y = ‘’Cookie’’

Get 100% Hike!

Master Most in Demand Skills Now !

Certain operations can be performed on a string:

  • We can use * to repeat the string for a specific number of times

Example: x*2

  • The string can be sliced, that is to select parts of the string

Example: Coke

z1 = x[2:]
print(z1)
# Slicing
z2 = y[0] + y[1]
print(z2)


Output: ke
Co
  • To capitalize the strings

Example:

 str.capitalize('cookie')
  • To retrieve the length of the strings

Example:

str1 = "Cake 4 U"
str2 = "404"
len(str1)
  • To replace parts of a string with another string

Example:

 str1.replace('4 U', str2)
  • Boolean: It is a built-in data type that can take the values TRUE or FALSE

Be a Python Expert. Enroll in Python training in Bangalore by Intellipaat!

Non- Primitive Data Structures:

  • Array: It is a compact way of collecting data types where all entries must be of the same data type.

Syntax of writing an array in python:

import array as arr
a = arr.array("I",[3,6,9])
type(a)
  • Linked list: A list in Python is used to store collection of heterogeneous items. It is described using the square brackets [] and hold elements separated by comma

Example:

x = [] # Empty list
type(x)

The list can be classified into linear and non-linear data structures
Linear data structures contain Stacks and queues
Non-linear data structures contain Graphs and Trees

  • Stack: It is a container of objects that can be inserted or removed according to LIFO (Last in First Out) pop() method is used during disposal in Python

Example:

stack.pop() # Bottom -> 1 -> 2 -> 3 -> 4 -> 5 (Top)
stack.pop() # Bottom -> 1 -> 2 -> 3 -> 4 (Top)
print(stack)
  • Queue: It is a container of objects that can be inserted or removed according to FIFO (First in First Out)
  • Graph: It is a data structure that consists of a finite set of vertices called nodes, and a finite set of ordered pair (u,v) called edges. It can be classified as direction and weight
  • Binary Tree: Tree is a hierarchical data structure. Here each node has at most two children
  • Binary Search Tree: It provides moderate access/ search and moderate insertion/ deletion
  • Heap: It is a complete tree and is suitable to be stored in an array, it is either MIN or Max
  • Hashing: Collection of items that are stored in a way that it becomes easy to find them is hashing

 

Types of Data Structures

 

For more, check out this Python Interview Questions video tutorial:

Lists and tuples (In Python):

An ordered sequence of values indexed by integer numbers. Tuples are immutable

  • To initialize empty list /tuple:

Syntax:

Lists: myList = []
Tuples: myTuple = ()
  • To specify size of tuple/list:

Syntax:

 len(m­yLi­stO­rTu­ple)
  • To get an element in position x in list/tuple:

Syntax:

 "x" in myList­OrT­uple
  • Index of element ‘X’ of list/tuple

Syntax:

myLis­tOr­Tup­le.i­nd­ex(­"­x") -- If not found, throws a Value­Error exception
  • A number of occurrences of X in list/tuple:

Syntax:

myLis­tOr­Tup­le.c­ou­nt(­"­x")
  • Update an item of List/tuple:

Syntax:

Lists: myList[x] = "x"
<strong>Tuples</strong>: tuples are immutable!
  • Remove element in position X of list/tuple:

Syntax:

Lists: del myList[x]
Tuples: tuples are immutable!
  • Concatenate two lists/tuples:
Lists: myList1 + myList2
Tuples: myTuple1 + myTuple2
Concatenating a List and a Tuple will produce a TypeE­rror exception
  • Insert element in position x of a list/t­uple

Syntax:

Lists: myLis­t.i­nse­rt(x, "value")
Tuples: tuples are immutable!
  • Append “­x” to a list/t­uple:
Syntax: Lists: myList.append("x")
Tuples: tuples are immutable!
  • Convert a list/tuple to tuple/list:
Syntax: List to Tuple: tuple(myList)
Tuple to List: list(­myT­uple)

Also, read about the difference between lists and tuples in Python to enhance your knowledge!

Sets:

Set is an unordered collection with no duplicate elements. It supports mathematical operations like union, inters­ection, difference, and symmetric differ­ence.

  • To initialize an empty set:
Syntax: mySet = set()
  • Initialize a non-empty set
Syntax: mySet = set(el­ement1, elemen­t2...)
  • To add element X to the set
Syntax: mySet.ad­d("x­")
  • Remove element “­x” from a set:

Syntax:

Method 1: mySet.re­mov­e("x­") -- If "­x" is not present, raises a KeyErorr
Method 2: mySet.di­sca­rd(­"­x") -- Removes the element, if present
  • Remove every element from the set
Syntax: mySet.cl­ear()
  • Check if “­x” is in the set
Syntax: "x" in mySet
  • Union of two sets

Syntax:

Method 1: mySet1.union(mySet2)
Method 2: mySet1 | mySet2
  • Inters­ection of two sets

Syntax:

Method 1: mySet1.intersect(mySet2)
Method 2: mySet1 & mySet2
  • Difference of two sets

Syntax:

Method 1: mySet1.difference(mySet2)
Method 2: mySet1 - mySet2
  • Symmetric difference of two sets

Syntax:

Method 1: mySet1.symmetric_difference(mySet2)
Method 2: mySet1 ^ mySet2
  • Size of the sets:

Syntax:

len(m­ySet)

Want to learn queues in Python? Refer to our blog on Python Queue and make exciting projects!

 

Dictionaries:

It is an unordered set of key-value pairs

  • Initialize an empty Dict

Syntax:

myDict = {}
  • Add an element with key “­k” to the Dict

Syntax:

myDic­t["k­"] = value
  • Update the element with key “­k”

Syntax:

myDic­t["k­"] = newValue
  • Get element with key “­k”

Syntax:

myDic­t["k­"] -- If the key is not present, a KeyError is raised
  • Check if the dictionary has key “­k”

Syntax:

"k" in myDict
  • Get the list of keys

Syntax:

myDic­t.k­eys()
  • Get the size of the dictionary

Syntax:

len(m­yDict)
  • Delete element with key “­k” from the dictionary

Syntax:

del myDict­["k"]
  • Delete all the elements in the dictionary

Syntax:

myDic­t.c­lear()

Certification in Full Stack Web Development

 

Algorithms and the complexities:

Algorithm Best case Average case Worst case Remarks
Selection sort ½ n 2 ½ n 2 ½ n 2 n exchanges,
quadratic is the best case
Insertion sort n ¼ n 2 ½ n 2 Used for small or partial-sorted arrays
Bubble sort n ½ n 2 ½ n 2 Rarely useful,
Insertion sort can be used instead
Shell sort n log3 n unknown c n 3/2 Tight code,
Sub quadratic
Merge sort ½ n lg n n lg n n lg n n log n guarantee;
stable
Quick sort n lg n 2 n ln n ½ n 2 n log n probabilistic guarantee;
fastest in practice
Heapsort n 2 n lg n 2 n lg n n log n guarantee;
in place

 

Symbol Table:

Worst case Average case
Data Structure Search Insert Delete Search Insert Delete
Sequential search n n n n n n
Binary search log n n n log n n n
Binary search tree n n n log n log n sqrt(n)
Red-black BST log n log n log n log n log n log n
Hash table n n n 1 1 1

Become a Full Stack Web Developer

 

Download a Printable PDF of this Cheat Sheet

With this, we are wrapping up the Python Data Structures Basic Cheat Sheet. To get in depth knowledge, check out our Data Science with Python that comes with 24*7 support to guide you throughout your learning period. Intellipaat’s Python course will let you master the concepts of the widely-used and powerful programming language Python. You will gain hands-on experience in various Python packages, such as SciPy, NumPy, MatPlotLib Python, Lambda function, and more. You will engage in practical Python projects and use them for a variety of big data, data science, and machine learning applications.

Prepare yourself for the industry by going through Python Technical Interview Questions now!

Course Schedule

Name Date Details
Python Course 22 Jun 2024(Sat-Sun) Weekend Batch
View Details
Python Course 29 Jun 2024(Sat-Sun) Weekend Batch
View Details
Python Course 06 Jul 2024(Sat-Sun) Weekend Batch
View Details

About the Author

Senior Consultant Analytics & Data Science

Presenting Sahil Mattoo, a Senior Consultant Analytics & Data Science at Eli Lilly and Company is an accomplished professional with 14 years of experience across data science, analytics, and technical leadership domains, demonstrates a remarkable ability to drive business insights. Sahil holds a Post Graduate Program in Business Analytics and Business Intelligence from Great Lakes Institute of Management.