ONLINE COURSE

Data Structures
Data Structures With
With Python Active

Python
2499
Master Data Structures With
999
Python
This course is designed to help Python
Login to Sign Up for Free
enthusiasts master the data structures with
the Python language itself Become Premium User & get additional 5% Off

professionals, students

Course Features
• Lifetime access to the Course

• Tracks-based learning

• Diverse coding problems for each topic

• Contests for practice

• Premium Lecture videos by industry experts

• Course Completion Certi�cate trusted by top universities and

companies

• Internship Opportunities at GeeksforGeeks

• Access to the GeeksforGeeks Jobs portal

Course Overview 
This course has been designed for Python enthusiasts, both students and
professionals, who are well-versed in Python but want to master the data
structures using the language. In this course, you will get access to
meticulously crafted video lectures that will explain to you the ways to
implement data structures like Linked Lists, Stacks, Heaps, Graphs, and
others. Moreover, you'll get access to a plethora of coding problems for
each data structure just so you become well versed in it. Beyond that, you
can practice your learned skills in a timed-environment by attempting
artfully crafted contests.

Course Content
− Analysis of Algorithms

• Analysis of Algorithms (Background)

• Order of Growth
• Best, Average and Worst Cases
• Big O Notation
• Omega Notation
• Theta Notation
• Analysis of Common Loops
• Analysis of Recursion
• Space Complexity

− List in Python

• List (Dynamic Sized Array) Introduction

• Working of List in Python
• Average or Mean of A List
• Separate Even and Odd
• Get Smaller Elements
• Slicing (List,Tuple And String)
• Comprehensions in Python
• Largest Element in a List
• Second Largest Element in a list
• Check if a list is Sorted
• Find the only Odd 
• Reverse a List in Python
 • Left Rotate a List by one
• Left Rotate by d Places

− String

• Escape Sequences and Raw Strings

• Reverse A String in Python
• String Comparison in Python
• Strings in Python
• Formmatted String in Python
• String Operations Part (1)
• String Operations Part (2)
• Pattern Searching in Python
• Check For Palindrome In Python

− Hashing

• Introduction to Hashing
• Hashing Application
• Hashing Functions
• Collision Handling
• Double Hashing
• Chaining vs Open Addressing
• Set in Python
• Dictionary in Python
• Count Distinct Elements in a List

− Recursion

• Recursion in Python
• Applications of Recursion
• Practice For Recursion (Part 1)
• Practice For Recursion (Part 2)
• Sum of Natural Numbers Using Recursion
• Print N to 1 using Recursion in Python
• Print 1 to N using Recursion in Python
• Sum Of Digits Using Recursion
• Tower of Hanoi in Python
• Josephus Problem in Python 
− Searching

• Binary Search in Python

• Recursive Binary Search in Python
• Analysis of Binary Search
• Index of First Occurrence
• Index of Last Occurrence
• Count Occurrences in a Sorted Array

− Sorting

• Bubble Sort
• Selection Sort
• Insertion Sort in Python
• Merge Two Sorted Arrays
• Merge Subarrays
• Merge Sort Algorithm
• Merge Sort Analysis
• Quick Sort Introduction
• Partition a Given Array
• Lomuto Partition
• Hoare's Partition
• Quick Sort using Lomuto Partition
• Quick Sort using Hoare's Partition
• Analysis of Quick Sort
• Space Analysis of Quick Sort
• Tail Call Elimination in Quick Sort
• Sorting in Python
• List Sort in Python
• Sorted in Python

− Linked List

• Linked List Introduction in Python

• Simple Linked List Implementation in Python
• Applications of Linlked List
• Traversing a Linked List in Python
• Search in Linked List
• Insert At The Bigenning of Linked list in Python
• Insert at The End Of Linked List

 • Insert at Given Position in Singly Linked list
• Delete First Node Of Linked List in Python
• Delete Last Node of Linked List
• Sorted Insert Linked List in Python
• Reverse a Linked List In Python
• Recursive Reverse A Linked List (Part 1)
• Recursive Reverse A Linked List (Part 2)

− Circular Linked List

• Circular Linked List in Python

• Circular Linked List (Advantages & Disadvantages)
• Circular Linked List traversal
• Insert at the Beginning of Circular Linked List
• Insert at The End of A Circular Linked List
• Delete Head of circular Linked List
• Delete Kth Node of Circular Linked List

− Doubly Linked List

• Doubly Linked List in Python

• Singly Vs Doubly Linked List (Advantages & Disadvantages)
• Insert at the Beginning of DLL in Python
• Insert at the End of DLL in Python
• Delete Head of A Doubly Linked List
• Delete Last Node of DLL in Python
• Reverse A Doubly Linked Llist in Python

− Stack

• Stack Data Structure

• Stack Applications
• Stack in Python
• Linked List Implementation of Stack in Pyrhon
• Check for Balanced Parenthesis in Python
• In�x, Pre�x and Post�x Introduction
• In�x to Post�x (Simple Solution)
• In�x to Post�x (E�cient Solution)
• Evaluation of Post�x 
• In�x to Pre�x (Simple Solution)
 • In�x to Pre�x (E�cient Solution)
• Evaluation of Pre�x

− Queue

• Queue Data Structure

• Application of Queue Data structure
• Queue in Python
• Linked List Implementation of Queue in Python
• Queue Implementation using Circular List

− Tree

• Tree Data Structure

• Tree Traversal
• Application of Tree
• Binary Tree in Python
• Inorder Traversal in Python
• Preorder Traversal in Python
• Postorder Traversal in Python
• Size of Binary Tree in Python
• Maximum in Binary Tree
• Search Binary Tree
• Height of Binary Tree
• Iterative Inorder Traversal
• Iterative Preorder Traversal
• Level Order Traversal

− Binary Search Tree

• Binary Search Tree(Background)

• Binaary Search Tree in Python
• Search in BST in Python
• BST insert in Python
• BST Delete in Python
• BST Floor in Python
• Floor in BST (Problem and Solution Idea)
• Ceiling in BST in Pytho

− Heap

• Binary Heap Introduction

• Heap Python Implementation (Introduction)
• Binary Heap Insert
• Binary Heap (Extract min and Heapify)
• Decrease Key and Delete Operations
• Build Heap
• Heapq in Python

− Graph

• Introduction to Graph
• Graph Representation (Adjacency Matrix)
• Graph Representation (Adjacency List)
• Adjacency Matrix and List Comparison
• Applications of BFS
• Applications of DFS

Show Less

FAQs
1. Is there any number to contact for any query?
You may call us on our toll-free number: 1800 123 8622 or Drop us an
email at geeks.classes@geeksforgeeks.org
2. Do we have doubt support in this program?
No, This program doesn't have doubt solving support.

3. Is this a language-speci�c course?

Yes, the course is only in Python.

4. How can I register for the course?

You need to sign up for the course. After signing up, you need to pay
when the payment link opens.

5. What type of certi�cate will be o�ered in this program

Once the course is completed. You'll be getting a course completion 
certi�cate.
6. When can I make the payment for the course?
The payment link will be available on the course page.

7. Will the course content be available after the course end date?
Course content comes with lifetime validity.

8. Can I make the payment through PayPal?

Yes. Mail us with your details at geeks.classes@geeksforgeeks.org.

9. Is there any demo lecture video of this course?

Yes, you may access the demo lecture here: Demo Video for Data
Structures with Python.

Course Registration

− Active Batches

Batch Date Type Register

DS With Python Active Online Classes

Login to Register

5th Floor, A-118,

 Sector-136, Noida, Uttar Pradesh - 201305

 feedback@geeksforgeeks.org


 Company Learn
About Us Algorithms

Careers Data Structures

Privacy Policy Languages

Contact Us CS Subjects

Terms of Service Video Tutorials

Practice Contribute
Courses Write an Article

Company-wise Write Interview Experience

Topic-wise Internships

How to begin? Videos

@geeksforgeeks , All rights reserved