Courses
Tutorials
Practice

Similar Topics

Web Technologies37.4K+ articles

DSA22.8K+ articles

Python21.3K+ articles

Python Programs4.0K+ articles

Amazon1.8K+ articles

Linked List1.2K+ articles

Microsoft802+ articles

Linked Lists302+ articles

Adobe280+ articles

Python DSA-exercises27+ articles

Python-DSA

233+ posts

Dynamic Programming in Python

Last Updated: 14 February 2025

Dynamic Programming is a commonly used algorithmic technique used to optimize recursive solutions when same subproblems are called again.The core idea behind DP is to stor...read more

article_image

Dynamic Programming

Introduction to Graphs in Python

Last Updated: 03 March 2025

Graphis anon-linear data structureconsisting of vertices and edges. The vertices are sometimes also referred to as nodes and the edges are lines or arcs that connect any t...read more

article_image

Inorder Traversal of Binary Tree in Python

Last Updated: 22 February 2025

Inorder traversalis defined as a type oftree traversal techniquewhich follows the Left-Root-Right pattern, such that:Theleft subtreeis traversed firstThen therootnode for ...read more

article_image

Preorder Traversal of Binary Tree in Python

Last Updated: 22 February 2025

Preorder traversalis defined as a type oftree traversalthat follows the Root-Left-Right policy where:Therootnode of the subtree is visited first.Then theleft subtreeis tra...read more

article_image

Postorder Traversal of Binary Tree in Python

Last Updated: 22 February 2025

Postorder traversalis defined as a type oftree traversalwhich follows the Left-Right-Root policy such that for each node:Theleft subtreeis traversed firstThen theright sub...read more

article_image

RoadMap for DSA in Python

Last Updated: 24 April 2025

Mastering Data Structures and Algorithms (DSA) is key to optimizing code and solving problems efficiently. Whether you're building applications or preparing for tech inter...read more

article_image

Trees in Python

Last Updated: 04 March 2025

Tree Data Structureis a non-linear data structurein which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one ...read more

article_image

Python Programs

Graphs in Python

Last Updated: 04 March 2025

Graphis anon-linear data structureconsisting of vertices and edges. The vertices are sometimes also referred to as nodes and the edges are lines or arcs that connect any t...read more

Python Programs

Python heapq.heappop() Method

Last Updated: 12 March 2025

The heapq.heappop() function in Python is used to pop and return the smallest element from a heap, maintaining the heap property. This function is extremely useful in situ...read more

Python heapq.heapify() Method

Last Updated: 17 March 2025

The heapq.heapify() function in Python is used to transform a regular list into a valid min-heap. A min-heap is a binary tree where the smallest element is always at the r...read more

Data Structures-Heap

Python heapq.nlargest() Method

Last Updated: 17 March 2025

The heapq.nlargest() method in Python is a useful function from the heapq module that returns the n largest elements from an iterable, such as a list or tuple. This method...read more

Data Structures-Heap

Python heapq.nsmallest() Method

Last Updated: 17 March 2025

The heapq.nsmallest() method in Python is part of the heapq module and is used to retrieve the n smallest elements from an iterable, such as a list, tuple or other iterabl...read more

Data Structures-Heap

Python heapq.heapreplace() Method

Last Updated: 21 April 2025

The heapq.heapreplace() function removes and returns the smallest element from a heap (the root) and inserts a new item into the heap, all while maintaining the heap prope...read more

Data Structures-Heap

Python heapq.merge() Method

Last Updated: 17 March 2025

The heapq.merge() method in Python is part of the heapq module, which is used for heap-related operations. This method allows you to merge multiple sorted input iterables ...read more

Python heapq.heappushpop() Method

Last Updated: 17 March 2025

The heapq.heappushpop() method is part of Python's heapq module, which provides an efficient way to implement heaps (also known as priority queues). This method is a combi...read more

Data Structures-Heap

...