static void Main(string[] args)
{
Console.WriteLine("Hello World!");
TreeTraversal.Run();
CheckIfBinaryTreeBST.Run();
BinaryTreeOperations.Run();
TransformToBST.Run();
LowestCommonAncestor.Run();
BSTOperations.Run();
Console.WriteLine();
GraphTraversal graph = new GraphTraversal();
graph.Run();
Console.WriteLine();
Console.WriteLine("Dijkstra Algo:");
Dijkstra dj = new Dijkstra();
dj.Run();
SortingAlogrithm.Run();
Console.WriteLine();
Console.WriteLine("Heap : ");
HeapProblem.Run();
Console.ReadLine();
}
static void Main(string[] args)
{
//SolutionInorderTraversal.Run();
//SolutionPreorderTraversal.Run();
//SolutionPostorderTraversal.Run();
//SolutionLevelOrderTraversal.Run();
//MaxDepthOfBTree.Run();
//SymmetricTree.Run();
//PathSum.Run();
//ReconstructFromInorderAndPostorder.Run();
//PopulatingNextRightPointers.Run();
LowestCommonAncestor.Run();
}