Construct Tree from given Inorder and Preorder traversals.Print Postorder traversal from given Inorder and Preorder traversals.Inorder Tree Traversal without recursion and without stack!.Inorder Tree Traversal without Recursion.Tree Traversals (Inorder, Preorder and Postorder).Breadth First Search or BFS for a Graph.Unique paths covering every non-obstacle block exactly once in a grid.Print all possible paths from top left to bottom right of a mXn matrix.Count all possible paths from top left to bottom right of a mXn matrix.Count number of ways to reach destination in a Maze.The Knight’s tour problem | Backtracking-1.Warnsdorff’s algorithm for Knight’s tour problem.Printing all solutions in N-Queen Problem.Graph implementation using STL for competitive programming | Set 1 (DFS of Unweighted and Undirected). ![]() Graph implementation using STL for competitive programming | Set 2 (Weighted graph).ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |