Prim’s algorithm for computing the minimum spanning tree of a graph. Now, let’s start off with some basic definitions. What is a spanning tree? A spanning tree is a subgraph that has the same vertex set as the original graph and is also a tree which means that it must be connected and must not […]

# Tag: coding

## 9.6: Genetic Algorithm: Improved Fitness Function – The Nature of Code

Hello welcome to another genetic algorithms video, in this video I want to talk about an improved fitness function, now there are so many different ways you can improve a fitness function in ways that you could design and think about a fitness function and I less mean this video to be like here’s one […]

## Deepest right leaf node in a binary tree | Iterative approach | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which helps us in finding the Deepest right leaf node in a binary tree .. First, let us take an examples. In this tree, The deepest right leaf node is the node with value 10. Now, […]

## Why You Must Learn Prefix Sum Algorithm? | Need of prefix-sum Algorithm | EP1

Hello my dear friend, Welcome to my youtube channel. Today, I am going to tell you, why you must learn the prefix sum Algorithm. Let’s start the same with the help of an example. In this example, I have taken an array A [] of seven elements, indexed from zero to six. And, If I […]

## Longest consecutive sequence in Binary tree | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which finds the longest consecutive sequence in a binary tree ..First, let us take an example.. In this example, for tree 1 the longest consecutive path is 9 10 11 and its length is 3.. In […]

## Foldable Binary Trees | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which checks if a given tree can be folded or not. First, let us see an example.. A tree can be folded if left and right subtrees of the tree are structure wise mirror image of […]

## Analysis of Merge sort algorithm

In our previous lesson, we had explained merge sort algorithm. Now, in this lesson we are going to analyze merge sort algorithm. We will look at various properties of merge sort algorithm. We will try to see how efficient it is terms of time and space complexity. Some of the properties of merge sort algorithm […]

## Kosaraju’s Algorithm – Strongly Connected Components | GeeksforGeeks

Kosaraju’s algorithm for finding strongly connected components of a graph. Let’s start off with definitions. First, a directed graph is strongly connected if there is a path between all pairs of vertices. Consider the graph shown here. Now, we can go from 0 to 1,2 or even 3. In fact, if we pick any 2 […]

## Convert a BST to a Binary Tree so that sum of greater keys is added to every key | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which Convert a BST to a Binary Tree such that sum of all greater keys is added to every key FIrst, let us take an example Now, let us see the approach. Solution: Do reverse Inoorder […]

## destruction and binary search in JavaScript. Codingame: “Shadows of the Knight” episode 1 – Solved

Programming shouldn’t be boring. Let’s play with a Codingame’s puzzle today. [Music playing] Hi! Let’s play and solve a puzzle titled “Shadows of the Knight” by Codingame. I’m Anatol and you are watching the Good Parts of the FrontEnd development. If this is your first time here, you wanna learn Frontend and JavaScript, start now […]