← Microsoft questions

Graph Reachability and BST Minimum Deletion

Filed under Microsoft

Determine if all nodes are reachable from a start node in a directed graph, extend it to check if all nodes are mutually connected, and write code to delete the smallest element from a Binary Search…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.