Handshaking Lemma and Interesting Tree Properties – Tree – Handshaking lemma is about undirected graph. In every finite undirected graph number of vertices
Divide and Conquer
9 Articles
9
Binary Tree Properties – Binary Tree – Here level is number of nodes on path from root to the node (including root and node). Level of root is 1.
Binary Tree (Types of Binary Tree) – A Binary tree is Perfect Binary Tree in which all internal nodes have two children and all leaves are at same level.
Python Program – Binary Tree (Introduction) – A tree whose elements have at most 2 children is called a binary tree. Let us create a simple tree with 4 node
Java Programming – Binary Tree (Introduction) – A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree
C Programming – Binary Tree (Introduction) – A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can
Shortest Paths – C/C++ – Dijkstra’s shortest path algorithm – Given a graph and a source vertex in graph, find shortest paths from source to all vertices
Strassen’s Matrix Multiplication-Divide and Conquer-Given two square matrices A and B of size n x n each, find their multiplication .
Closest Pair of Points – Divide and Conquer – We are given an array of n points in the plane, and the problem is to find out the closes together.
Java Programming-Count Inversions in an array-Divide and Conquer-Inversion Count for an array indicates how far (or close) the array is from being sorted.