Author Biographical Info: Not available
Check if a given binary tree is perfect or not in Python
The problem in hand is checking whether a given binary tree is perfect or not. So, before talking about Perfect binary tress let us first talk about binary trees. A binary tree is .... Read More
Python program to implement Multistage Graph (Shortest Path)
Here we will learn how to implement a multistage graph in Python (Shortest Path). A multistage graph is a special type of graph. In this type of graph, we partition the vertices in.... Read More
How to convert min Heap to max Heap in Python
Heap is a binary tree data structure. In this type of data structure, the value at the root node is compared to the value of its children. This comparison gives rise to two differe.... Read More
Define Clean up actions in Python
Clean up actions are those statements within a program that are always executed. These statements are executed even if there is an error in the program. If we have used exception h.... Read More
Open a website automatically at a specific time in Python
In this tutorial, we will learn how to create a Python program that will automatically open an URL or webpage at a specific given time on our browser. We all know how the alarm wor.... Read More
Find the Longest Possible Route in a Matrix with Hurdles in Python
The problem in hand is to find the longest possible route in a matrix with hurdles using Python code. Let’s break the information that we have and that we need to find: A R x.... Read More
How to Count maximum points on same line in Python
A line contains an infinite number of points on its surface. Hence, if we are given a set point then there is a huge possibility of more than 1 point lying on the same line. So t.... Read More
Diagonal traversal of a binary tree in Python
The problem is that given a binary tree we need to print all the elements diagonally. A binary tree is a type of tree with each internal node has at most two children, one left and.... Read More