Handshaking Lemma and Interesting Tree Properties
Handshaking Lemma and Interesting Tree Properties - Tree - Handshaking lemma is about undirected graph. In every finite...
Browse Category
Divide and Conquer
15 Articles
Binary Tree (Properties)
Binary Tree Properties - Binary Tree - Here level is number of nodes on path from root to the node (including root and...
Binary Tree | Set 3 (Types of Binary Tree)
Binary Tree (Types of Binary Tree) - A Binary tree is Perfect Binary Tree in which all internal nodes have two children and...
Python Program – Binary Tree | Set 1 (Introduction)
Python Program - Binary Tree (Introduction) - A tree whose elements have at most 2 children is called a binary tree. Let us...
Java Programming – Binary Tree | Set 1 (Introduction)
Java Programming - Binary Tree (Introduction) - A tree whose elements have at most 2 children is called a binary tree. Since...
C Programming – Binary Tree | Set 1 (Introduction)
C Programming - Binary Tree (Introduction) - A tree whose elements have at most 2 children is called a binary tree. Since...
Shortest Paths – C/C++ – Dijkstra’s shortest path algorithm
Shortest Paths - C/C++ - Dijkstra’s shortest path algorithm - Given a graph and a source vertex in graph, find shortest...
Strassen’s Matrix Multiplication
Strassen’s Matrix Multiplication-Divide and Conquer-Given two square matrices A and B of size n x n each, find their...
Closest Pair of Points
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...
Count Inversions in an array
Java Programming-Count Inversions in an array-Divide and Conquer-Inversion Count for an array indicates how far (or close)...
