https://notexponential.com/questions/graph-traversal Powered by Question2Answer https://notexponential.com/377/topological-sort Given a directed acyclic graph G=(V,E), a topological sort T is an ordering of vertices, such that, for each directed edge(u,v) in E, u comes before v in T. Which is the best possible algorithm to perform a topological sort on the graph. Backtracking/DFS/BFS https://notexponential.com/377/topological-sort Sat, 05 Nov 2016 21:05:25 +0000 https://notexponential.com/376/finding-non-leaf-node-of-a-tree-with-no-large-subtrees When you create a non-leaf node of a tree, you create more than 1 subtree. Given a tree with n nodes, give an algorithm to find a non-leaf node v, such that deletion of node v leaves no subtree with more than n/2 nodes. Backtracking/DFS/BFS https://notexponential.com/376/finding-non-leaf-node-of-a-tree-with-no-large-subtrees Sat, 05 Nov 2016 21:04:24 +0000