AVL Tree
Always a balanced tree
Always a balanced tree
Find Convex Hull - a polygon that surrounds all points
# All pair shortest path algorithm
Algorithm to find the max flow to the sink in a given [network]
Depth First Traversal <br/>Breadth First Traversal
Greatest common divisor using Euclidean Algorithm
Two lines (P1, P2) and (P3,P4) intersect when orientation of:
K-d tree is a binary search tree with more than 1 dimensions (i.e k dimensions).
Knapsack Problem: Given total capacity [totalCapacity] of a bag,
Given a number of lines, find the lines that intersects with each other
Given a target T and a set of points S, find the nearest neighbour of T in S.
Link
Prim Algorithm starts from min cost edge and then selects the next small cost edge
https://algs4.cs.princeton.edu/92search/QuadTree.java.html